|
|
|
|
![[parent]](http://images.planetmath.org:8080/images/uparrow.png)
generalized sequential machine
|
(Definition)
|
|
"generalized sequential machine" is owned by CWoo.
|
|
(view preamble | get metadata)
See Also: state-output machine
| Other names: |
gsm, deterministic generalized sequential machine |
| Also defines: |
gsm mapping, inverse gsm mapping, deterministic gsm |
This object's parent.
|
|
Cross-references: context-sensitive languages, T0, context-free, closed under inverse, Chomsky hierarchy, closure, closed under, starting symbol, non-terminals, generating, homomorphism, regular language, converse, generates, productions, formal grammar, iff, starting state, acceptor, functional, contain, inverse, translations, mapping, clear, final states, start state, languages, translate, formula, prefix, empty word, right, component, Mealy machine, singleton, deterministic, transition function, elements, restrictions, subset, alphabet, configurations, current, functions, finite state machine, sequential machines, state, finite
There are 4 references to this entry.
This is version 12 of generalized sequential machine, born on 2009-06-05, modified 2009-08-09.
Object id is 11813, canonical name is GeneralizedSequentialMachine.
Accessed 897 times total.
Classification:
| AMS MSC: | 68Q45 (Computer science :: Theory of computing :: Formal languages and automata) | | | 03D05 (Mathematical logic and foundations :: Computability and recursion theory :: Automata and formal grammars in connection with logical questions) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|
