The pseudovariety is hyperdecidable
J. Almeida, M. Zeitoun (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Decomposing a -valued transducer into unambiguous ones”
The pseudovariety is hyperdecidable
On ambiguity in DOS systems
Andrzej Ehrenfeucht, David Haussler, Grzegorz Rozenberg (1984)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Shuffle binoids
S. L. Bloom, Z. Ésik (1998)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Coordinated pair systems ; part I : Dyck works and classical pumping
A. Ehrenfeucht, H. J. Hoogeboom, G. Rozenberg (1986)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Lower bounds on the complexity of real-time branching programs
Klaus Kriegel, Stephan Waack (1988)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On sets bounded truth-table reducible to -selective sets
Thomas Thierauf, Seinosuke Toda, Osamu Watanabe (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The topologies of sofic subshifts have computable Pierce invariants
Tom Head (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: