24 search results - page 2 / 5 » Word Operation Closure and Primitivity of Languages |
DLT
2006
13 years 10 months ago
2006
Duplication is an operation generating a language from a single word by iterated application of rewriting rules u uu on factors. We extend this operation to entire languages and i...
LICS
2009
IEEE
14 years 3 months ago
2009
IEEE
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...
LATA
2009
Springer
14 years 3 months ago
2009
Springer
We consider a restricted variant of the hairpin completion called bounded hairpin completion. The hairpin completion is a formal operation inspired from biochemistry. Applied to a ...
CAV
2012
Springer
11 years 11 months ago
2012
Springer
Nested-word automata (NWAs) are a language formalism that helps bridge the gap between finite-state automata and pushdown automata. NWAs can express some context-free properties, ...
MFCS
2001
Springer
14 years 29 days ago
2001
Springer
Abstract. We prove that the class of context-free languages with polynomially bounded ambiguity (PCFL) is the closure of the class of unambiguous languages (UCFL) under projections...