A hierarchy of cyclic languages
O. Carton (1997)
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.
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 “Circular splicing and regularity”
A hierarchy of cyclic languages
On structural unambiguity of formal languages
Jozef Gruska (1965)
Czechoslovak Mathematical Journal
Similarity:
Formal languages in dynamical systems
Günter Troll (1993)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
On the expressive power of the shuffle operator matched with intersection by regular sets
Joanna Jȩdrzejowicz, Andrzej Szepietowski (2001)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We investigate the complexity of languages described by some expressions containing shuffle operator and intersection. We show that deciding whether the shuffle of two words has a nonempty intersection with a regular set (or fulfills some regular pattern) is NL-complete. Furthermore we show that the class of languages of the form , with a shuffle language and a regular language , contains non-semilinear languages and does not form a family of mildly context- sensitive languages. ...
Consensual languages and matching finite-state computations
Stefano Crespi Reghizzi, Pierluigi San Pietro (2011)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
An ever present, common sense idea in language modelling research is that, for a word to be a valid phrase, it should comply with multiple constraints at once. A new language definition model is studied, based on agreement or consensus between similar strings. Considering a regular set of strings over a bipartite alphabet made by pairs of unmarked/marked symbols, a match relation is introduced, in order to specify when such strings agree. Then a regular set over the bipartite alphabet...
Consensual languages and matching finite-state computations
Stefano Crespi Reghizzi, Pierluigi San Pietro (2011)
RAIRO - Theoretical Informatics and Applications
Similarity:
An ever present, common sense idea in language modelling research is that, for a word to be a valid phrase, it should comply with multiple constraints at once. A new language definition model is studied, based on agreement or consensus between similar strings. Considering a regular set of strings over a bipartite alphabet made by pairs of unmarked/marked symbols, a match relation is introduced, in order to specify when such strings agree. Then a regular set over the bipartite alphabet...