The topological structure of adherences of regular languages
Tom Head (1986)
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.
Displaying similar documents to “The topologies of sofic subshifts have computable Pierce invariants”
The topological structure of adherences of regular languages
FPOL systems generating counting languages
A. Ehrenfeucht, G. Rozenberg (1981)
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:
Comparison of basic language generating devices (non-deterministic systems)
Manfred Kudlek (1990)
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:
Single-tape reset machines
S. A. Greibach, C. Wrathall (1986)
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: