The pseudovariety is hyperdecidable
J. Almeida, M. Zeitoun (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
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.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “The closure under division and a characterization of the recognizable -subsets”
The pseudovariety is hyperdecidable
A decision method for the recognizability of sets defined by number systems
Juha Honkala (1986)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Languages obtained from infinite words
T. Harju, L. Ilie (1997)
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:
On free inverse monoid languages
Pedro V. Silva (1996)
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:
Decomposing a -valued transducer into unambiguous ones
Andreas Weber (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: