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:
Gheorghe PĂun (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Gheorghe PăUN (1980)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
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...
J. Duske, M. Middendorf, R. Parchmann (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Jürgen Dassow, Gheorghe Păun (1985)
Kybernetika
Similarity:
G. Păun (1977)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: