81 search results - page 1 / 17 » Closure of Language Classes Under Bounded Duplication |
DLT
2006
13 years 6 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...
DLT
2007
13 years 6 months ago
2007
Recently the duplication closure of words and languages has received much interest. We investigate a reversal of it: the duplication root reduces a word to a square-free one. After...
MFCS
2001
Springer
13 years 9 months 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...
ITA
2007
13 years 5 months ago
2007
Duplication is the replacement of a factor w within a word by ww. This operation can be used iteratively to generate languages starting from words or sets of words. By undoing dupl...
FOSSACS
2004
Springer
13 years 10 months ago
2004
Springer
In this work we generalize the fundamental notion of recognizability from untimed to timed languages. The essence of our definition is the existence of a right-morphism from the m...