The topologies of sofic subshifts have computable Pierce invariants
Tom Head (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “The topological structure of adherences of regular languages”
The topologies of sofic subshifts have computable Pierce invariants
Comparison of basic language generating devices (non-deterministic systems)
Manfred Kudlek (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
One counter languages and the chevron operation
S. A. Greibach (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Characterizations of the Dyck sets
Celia Wrathall (1977)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On the hierarchy of Petri net languages
Matthias Jantzen (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The strong independence of substitution and homomorphic replication
S. A. Greibach (1978)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Fair expressions and regular languages over lists
L. Breveglieri (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: