On frontiers of regular trees
Wolfgang Thomas (1986)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “A finite axiomatization of nondeterministic regular expressions”
On frontiers of regular trees
First-order properties of trees, star-free expressions, and aperiodicity
Uschi Heuter (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A Finite Axiomatization of Nondeterministic Regular Expressions
Flavio Corradini, Rocco De Nicola, Anna Labella (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
An alternative (tree-based) semantics for a class of regular expressions is proposed that assigns a central rôle to the + operator and thus to nondeterminism and nondeterministic choice. For the new semantics a consistent and complete axiomatization is obtained from the original axiomatization of regular expressions by Salomaa and by Kozen by dropping the idempotence law for + and the distribution law of • over +.
Computing -free NFA from regular expressions in time
Christian Hagenah, Anca Muscholl (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Yield-languages recognized by alternating tree recognizers
Kai Salomaa (1988)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Decidability of equivalence for a class of non-deterministic tree transducers
Yves André, Max Dauchet (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Systolic tree acceptors
Karel Ii Culik, Arto Salomaa, Derick Wood (1984)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: