A Kleene-Schützenberger theorem for Lindenmayerian rational power series
Juha Honkala (2000)
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.
Displaying similar documents to “On lindenmayerian rational subsets of monoids”
A Kleene-Schützenberger theorem for Lindenmayerian rational power series
Iteration of rational transductions
Alain Terlutte, David Simplot (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Compositional representation of rational functions
T. Harju, H. C. M. Kleijn, M. Latteux (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Context-free languages with rational index in for algebraic numbers
Laurent Pierre, Jean-Marc Farinone (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Fixed point languages of rational transductions.
W. Forys (1986-1987)
Semigroup forum
Similarity:
On the inclusion problem for finitely ambiguous rational trace languages
A. Bertoni, P. Massazza (1998)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Decision problems among the main subfamilies of rational relations
Olivier Carton, Christian Choffrut, Serge Grigorieff (2006)
RAIRO - Theoretical Informatics and Applications
Similarity:
We consider the four families of recognizable, synchronous, deterministic rational and rational subsets of a direct product of free monoids. They form a strict hierarchy and we investigate the following decision problem: given a relation in one of the families, does it belong to a smaller family? We settle the problem entirely when all monoids have a unique generator and fill some gaps in the general case. In particular, adapting a proof of Stearns, we show that it is recursively decidable whether...