Question

Write a program in python programming language using functions to implement/simulate a finite automaton that accepts (only): Signed and unsigned real numbers. // .12345, 1.2345, -12345., +12345E0, .12345E-10, 1.2345E+1, etc. Show: Finite Automaton Definition, Graph, Table

Answer 1

IF YOU HAVE ANY DOUBTS COMMENT BELOW I WILL BE THERE TO HELP YOU

ANSWER:

CODE:

from automata.fa.dfa import DFA
# DFA which matches all binary strings ending in an odd number of '1's
dfa = DFA(
    states={'q0', 'q1', 'q2'},
    input_symbols={'0', '1'},
    transitions={
        'q0': {'0': 'q0', '1': 'q1'},
        'q1': {'0': 'q0', '1': 'q2'},
        'q2': {'0': 'q2', '1': 'q1'}
    },
    initial_state='q0',
    final_states={'q1'}
)

HOPE IT HELPS YOU

RATE THUMBSUP PLEASE