Kernel: Python 3
automaton
.is_isomorphic
(aut
)
Whether this automaton isomorphic to aut
, i.e., whether they are "the same graph."
Preconditions:
Both automata are accessible
See also:
Examples
Boolean Automata
Automata are isomorphic if there is a bijection between their states.
The following function takes a (Boolean) rational expression, and return its standard automaton.
In [1]:
In [2]:
In [3]:
(True, False)
The automata must be accessible, but coaccessibility is not required.
In [4]:
In [5]:
In [6]:
(True, False)
Equivalent automata can be non isomorphic.
In [7]:
(False, True)
Weighted Automata
We now build automaton weighted in .
In [8]:
True
In [9]:
False