使用python编写完整的可以将正规式((ab)|b)(a|(ba)*)a转化成NFA的代码，并将NFA以文本的形式输出，并可以使用graphviz进行查看

可以使用Python中的`pydot`库和`graphviz`软件来生成NFA的图形化表示。以下是将给定正则表达式转换为NFA的完整代码：

import pydot

class State:
    def __init__(self, label=None):
        self.transitions = {}
        self.label = label
        self.accepting = False
        
class NFA:
    def __init__(self, start=None):
        self.start = start
        self.end = start
        self.states = [start] if start is not None else []

    def connect(self, from_state, to_state, symbol=None):
        if symbol not in from_state.transitions:
            from_state.transitions[symbol] = []
        from_state.transitions[symbol].append(to_state)

    def add_state(self, state):
        self.states.append(state)

    def set_accepting(self, state):
        state.accepting = True
        
def regex_to_nfa(regex):
    stack = []
    nfa_start_state = State()
    nfa_end_state = State()
    nfa = NFA(nfa_start_state)
    stack.append((nfa_start_state, nfa_end_state))
    i = 0
    while i < len(regex):
        c = regex[i]
        if c == '(':
            group_start = State()
            group_end = State()
            nfa.add_state(group_start)
            nfa.add_state(group_end)
            if len(stack) > 0:
                prev_start, prev_end = stack[-1]
                nfa.connect(prev_end, group_start)
            stack.append((group_start, group_end))
        elif c == '|':
            prev_start, prev_end = stack.pop()
            nfa_end_state = State()
            nfa.add_state(nfa_end_state)
            nfa.connect(nfa_start_state, prev_start)
            nfa.connect(prev_end, nfa_end_state)
            stack.append((nfa_end_state, nfa_end_state))
        elif c == '*':
            prev_start, prev_end = stack.pop()
            nfa.connect(nfa_end_state, prev_start)
            nfa.connect(prev_end, nfa_start_state)
            nfa.add_state(nfa_end_state)
            stack.append((nfa_start_state, nfa_end_state))
        elif c == ')':
            group_start, group_end = stack.pop()
            if i + 1 < len(regex) and regex[i + 1] == '*':
                nfa.connect(nfa_end_state, group_start)
                nfa.connect(group_end, nfa_start_state)
                nfa.add_state(nfa_end_state)
                stack.append((nfa_start_state, nfa_end_state))
            else:
                nfa.connect(stack[-1][1], group_start)
                nfa_end_state = group_end
        else:
            state = State()
            nfa.add_state(state)
            nfa.connect(nfa_end_state, state, c)
            nfa_end_state = state
            stack.append((state, state))
        i += 1
    nfa.set_accepting(nfa_end_state)
    return nfa

def nfa_to_dot(nfa):
    dot = pydot.Dot(graph_type='digraph')
    for state in nfa.states:
        node = pydot.Node(str(id(state)), shape='circle')
        if state.accepting:
            node.set_shape('doublecircle')
        dot.add_node(node)
        for symbol in state.transitions:
            for to_state in state.transitions[symbol]:
                edge = pydot.Edge(str(id(state)), str(id(to_state)), label=symbol)
                dot.add_edge(edge)
    return dot.to_string()

regex = '((ab)|b)(a|(ba)*)a'
nfa = regex_to_nfa(regex)
dot = nfa_to_dot(nfa)
print(dot)

代码输出为NFA的DOT格式，可以将其保存为文件，并使用Graphviz软件将其转换为图像。