A fixed point characterization of cofinite languages.
W. Forys (1984)
Semigroup forum
Similarity:
W. Forys (1984)
Semigroup forum
Similarity:
Masashi Katsura (1988)
Semigroup forum
Similarity:
G. Thierrin, C.M. Reis, Y.Q. Guo (1988)
Semigroup forum
Similarity:
H.J. Shyr (1986)
Semigroup forum
Similarity:
C.M. Reis (1987)
Semigroup forum
Similarity:
Gerard Lallement (1989)
Semigroup forum
Similarity:
J. Almeida (1984)
Semigroup forum
Similarity:
A. Ehrenfeucht, G. Rozenberg (1983)
Semigroup forum
Similarity:
Marcella Anselmo, Maria Madonia (2011)
RAIRO - Theoretical Informatics and 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...