Aperiodic finite state automaton
http://dbpedia.org/resource/Aperiodic_finite_state_automaton an entity of type: Abstraction100002137
An aperiodic finite-state automaton (also called a counter-free automaton) is a finite-state automaton whose transition monoid is aperiodic.
rdf:langString
rdf:langString
Aperiodic finite state automaton
xsd:integer
17995149
xsd:integer
1032099919
rdf:langString
December 2020
rdf:langString
What constraints are placed on x,y,z and n ?
rdf:langString
An aperiodic finite-state automaton (also called a counter-free automaton) is a finite-state automaton whose transition monoid is aperiodic.
xsd:nonNegativeInteger
3439