scientific article

zbMath0489.68071MaRDI QIDQ3951572

Rockford J. Ross, Karl Winklmann

Publication date: 1982

Full work available at URL: https://eudml.org/doc/92161

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (15)

On the context-freeness of the set of words containing overlaps ⋮ On the language of primitive words ⋮ The interchange or pump (di)lemmas for context-free languages ⋮ An efficient algorithm for online square detection ⋮ On the generation of powers by OS schemes ⋮ Uniformly bounded duplication codes ⋮ Most pseudo-copy languages are not context-free ⋮ An optimal algorithm for computing the repetitions in a word ⋮ Sharp characterizations of squarefree morphisms ⋮ Permutations are not context-free: An application of the interchange lemma ⋮ Duplication in DNA Sequences ⋮ Efficient on-line repetition detection ⋮ Unnamed Item ⋮ Uniformly bounded duplication languages ⋮ An infinite square-free co-CFL

Cites Work

• Avoidable patterns in strings of symbols
• Erasable context-free languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: