Some further remarks on the family of finite index matrix languages
Gheorghe PĂun (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “On simple matrix languages versus scattered context languages”
Some further remarks on the family of finite index matrix languages
Some consequences of a result of Ehrenfeucht and Rozenberg
Gheorghe PăUN (1980)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Classes of two-dimensional languages and recognizability conditions
Marcella Anselmo, Maria Madonia (2010)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The paper deals with some classes of two-dimensional recognizable languages of “high complexity”, in a sense specified in the paper and motivated by some necessary conditions holding for recognizable and unambiguous languages. For such classes we can solve some open questions related to unambiguity, finite ambiguity and complementation. Then we reformulate a necessary condition for recognizability stated by Matz, introducing a new complexity function. We solve an open question proposed...
Indexed counter languages
J. Duske, M. Middendorf, R. Parchmann (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Further remarks on the complexity of regulated rewriting
Jürgen Dassow, Gheorghe Păun (1985)
Kybernetika
Similarity:
An operation with languages occurring in the linguistic approach to the management
G. Păun (1977)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A note on the undecidability of contextfreeness
J. Albert (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: