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

好的，下面是使用Python编写的将正则表达式转换为NFA的代码：

class NFAState:
    def __init__(self, label):
        self.label = label
        self.transitions = {}

    def add_transition(self, symbol, state):
        if symbol not in self.transitions:
            self.transitions[symbol] = []
        self.transitions[symbol].append(state)


class NFA:
    def __init__(self, start, accept):
        self.start = start
        self.accept = accept

    def to_dot(self):
        dot = ['digraph NFA {',
               '  rankdir="LR";',
               '  node [shape=circle];']
        state_labels = {}
        state_queue = [self.start]
        state_count = 0
        while state_queue:
            state = state_queue.pop(0)
            if state not in state_labels:
                state_count += 1
                state_labels[state] = 'q%d' % state_count
                shape = 'doublecircle' if state == self.accept else 'circle'
                dot.append('  %s [label="%s" shape=%s];' % (state_labels[state], state.label, shape))
                for symbol, target_states in state.transitions.items():
                    for target_state in target_states:
                        state_queue.append(target_state)
                        if target_state not in state_labels:
                            state_count += 1
                            state_labels[target_state] = 'q%d' % state_count
                            dot.append('  %s [label="%s" shape=circle];' % (state_labels[target_state], target_state.label))
                        dot.append('  %s -> %s [label="%s"];' % (state_labels[state], state_labels[target_state], symbol))
        dot.append('}')
        return '\n'.join(dot)


def parse_regex(regex):
    # Convert infix notation to postfix notation
    postfix = []
    stack = []
    for c in regex:
        if c in '()|*':
            if stack and stack[-1] != '(' and c in '|*':
                postfix.append(stack.pop())
            stack.append(c)
        elif c in 'abcdefghijklmnopqrstuvwxyz':
            postfix.append(c)
    while stack:
        postfix.append(stack.pop())

    # Build NFA from postfix notation
    state_count = 0
    state_stack = []
    for symbol in postfix:
        if symbol == '|':
            right = state_stack.pop()
            left = state_stack.pop()
            accept = NFAState(None)
            start = NFAState(None)
            start.add_transition(None, left)
            start.add_transition(None, right)
            left.add_transition(None, accept)
            right.add_transition(None, accept)
            state_stack.append(NFA(start, accept))
        elif symbol == '*':
            inner = state_stack.pop()
            accept = NFAState(None)
            start = NFAState(None)
            start.add_transition(None, inner.start)
            start.add_transition(None, accept)
            inner.accept.add_transition(None, inner.start)
            inner.accept.add_transition(None, accept)
            state_stack.append(NFA(start, accept))
        else:
            accept = NFAState(None)
            start = NFAState(None)
            start.add_transition(symbol, accept)
            state_stack.append(NFA(start, accept))

    return state_stack.pop()


if __name__ == '__main__':
    regex = '((ab)|b)(a|(ba)*)a'
    nfa = parse_regex(regex)
    print(nfa.to_dot())

此代码将正则表达式解析为NFA，然后以DOT格式输出，可以使用Graphviz将其转换为图像。要使用Graphviz，请确保已将其安装在计算机上，并运行以下命令：

dot -Tpng nfa.dot -o nfa.png

其中`nfa.dot`是上面生成的DOT文件，`nfa.png`是输出的图像文件。

这将生成一个图像文件，显示NFA的状态和转换。