Directable automata and directly subdefinite events
Alica Pirická (1972)
Kybernetika
Similarity:
Displaying similar documents to “On a certain event recognizable in real time”
Directable automata and directly subdefinite events
On the complexity of events recognizable in real time
Miloslav Nekvinda (1973)
Kybernetika
Similarity:
On the directability of automata
Lassi Niemelä (1989)
Kybernetika
Similarity:
Two-way automaton computations
Jean-Camille Birget (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The factor automaton
Milan Šimánek (2002)
Kybernetika
Similarity:
This paper concerns searching substrings in a string using the factor automaton. The factor automaton is a deterministic finite automaton constructed to accept every substring of the given string. Nondeterministic factor automaton is used to achieve new operations on factor automata for searching in non-constant texts.