Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
KlausSutner`Automata`Fsm`
StateType  |
| StateType is an option for several commands that controls the kind of structured state set used in a transition system. | |
Details and Options
Examples
(1)
Basic Examples
(1)
A nondeterministic machine that checks that the third symbol from the end is an . Since we are counting symbols from the start, it is natural to use states 0,1,2,3.
a
In[1]:=
M=
"a",-3,
[2]
 | PositionFA |
 | Alpha |
In[2]:=
M=FA
;
 |  |
| ||||
In[3]:=
M//
 | StateList |
Out[3]=
{0,1,2,3}
Determinization produces new states that are sets of old states. By default, the states are renumbered so that the old machine effectively has state set .
[4]
In[4]:=
| DeterminizeFA |
| StateList |
Out[4]=
{{1},{1,2},{1,2,3},{1,3},{1,2,3,4},{1,3,4},{1,2,4},{1,4}}
We can index the states in the new machine, removing all structure information.
In[5]:=
| DeterminizeFA |
| StateType |
| StateList |
Out[5]=
{1,2,3,4,5,6,7,8}
We can also force the old state set to be fully preserved.
In[6]:=
MM=
M,
"Deep";MM//
 | DeterminizeFA |
 | StateType |
| StateList |
Out[6]=
{{0},{0,1},{0,1,2},{0,2},{0,1,2,3},{0,2,3},{0,1,3},{0,3}}
The automaton is already minimal.
In[7]:=
| MinimizeFA |
| StateType |
| StateList |
Out[7]=
{{{0}},{{0,1}},{{0,1,2}},{{0,2}},{{0,1,2,3}},{{0,2,3}},{{0,1,3}},{{0,3}}}
 |
|
 |
|
 |
|
""