On the Representability of Relations by Deterministic and Nondeterministic Multi-Tape Automata.
Peter H. StarkePublished in: MFCS (1975)
Keyphrases
- finite automata
- finite state
- high speed
- turing machine
- deterministic automata
- finite state automaton
- finite automaton
- temporal relations
- markov chain
- regular expressions
- tree automata
- deterministic finite automata
- causal relations
- finite state automata
- fully observable
- probabilistic automata
- integrity constraints
- attribute values