Finite branching automata
Havel, Ivan M. (1974)
Kybernetika
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On families recognizable by finite branching automata”
Finite branching automata
Two infinite hierarchies of languages defined by branching grammars
Gheorghe Păun (1978)
Kybernetika
Similarity:
Hierarchies of aperiodic languages
Janusz A. Brzozowski (1974-1975)
Séminaire Dubreil. Algèbre et théorie des nombres
Similarity:
Unambiguous recognizable two-dimensional languages
Marcella Anselmo, Dora Giammarresi, Maria Madonia, Antonio Restivo (2006)
RAIRO - Theoretical Informatics and Applications
Similarity:
We consider the family UREC of unambiguous recognizable two-dimensional languages. We prove that there are recognizable languages that are inherently ambiguous, that is UREC family is a proper subclass of REC family. The result is obtained by showing a necessary condition for unambiguous recognizable languages. Further UREC family coincides with the class of picture languages defined by unambiguous 2OTA and it strictly contains its deterministic counterpart. Some closure and non-closure...