Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
"NFA"
| "NFA" a nondeterministic finite automaton (NFA) | |
▪
Creating a virtual machine instance:
create a new instance of a nondeterministic finite automaton configured according to assoc |
▪
The following keys can be used to specify a given as an association:
"RegisterMachine"
"AcceptingStates" | { s 1 s 2 | a list of the machine's accepting states | |
"InitialState" | s | the machine's initial state | |
"InputSymbols" | a list of allowed input symbols | ||
"States" | a list of allowed machine states | ||
"TransitionFunction" | {{ s in s out1 s out2 | a list of rules specifying the state's transition function |
▪
If , the allowed symbols are determined from the value of .
"TransitionFunction"
▪
▪
For the virtual machine, the following properties can be queried:
"RegisterMachine"
obj["Definition"] | ||
obj["Evolution"] | a list representing the evolution of the machine | |
obj["EvolutionDataset"] | ||
obj["Input"] | a list representing the machine's current input | |
obj["MachineState"] | ||
obj["StepCount"] | the number of steps run | |
obj["TransitionFunction"] | a formatted version of the machine's transition function | |
obj["TransitionTable"] | a table version of the machine's transition function |
▪
For the virtual machine, the following commands can be executed using :
"RegisterMachine"
set the current machine's input to input | ||
reset the state of the machine to its initial configuration | ||
run n |
Examples | MoreExamples⊳ |
Create an instance of a that accepts all lists ending in :
"NFA"
{…,0,1}
In[1]:=
nfa=
["NFA","TransitionFunction"{{,0}{,},{,1}{},{,1}{}},"InitialState","AcceptingStates"{}]
 | VirtualMachine |
q
0
q
0
q
1
q
0
q
0
q
1
q
2
q
0
q
2
Out[1]=
VirtualMachineObject
 |  |
|
Obtain information about the object:
In[2]:=
Information[nfa]
Out[2]=
VirtualMachineObject | |||||||||
|
Get an association representing the machine state:
In[3]:=
nfa["MachineState"]
Out[3]=
CurrentStates{},Input{},StatusWaiting,TerminationReasonNone
q
0
Visualize the transition function:
In[4]:=
nfa["TransitionTable"]
Out[4]//TableForm=
0 | 1 | |
⟶ q 0 | { q 0 q 1 | { q 0 |
q 1 | ∅ | { q 2 |
* q 2 | ∅ | ∅ |
Push an input into the machine:
In[5]:=
 | VirtualMachineExecute |
Out[5]=
VirtualMachineObject
| |
|
Run the NFA until it halts:
In[6]:=
| VirtualMachineExecute |
Out[6]=
VirtualMachineObject
| |
|
Extract the evolution history of the executed steps:
In[7]:=
nfa["EvolutionDataset"]
Out[7]=
| ||||||||||||||||||||||
The NFA has accepted the input:
In[8]:=
nfa["MachineState"]["TerminationReason"]
Out[8]=
InputAccepted
Basic Examples
Neat Examples
""