A result about languages concerning paperfolding sequences

DOI10.1007/BF01213862zbMath0780.68083MaRDI QIDQ4013407

Siegfried Lehr

Publication date: 27 September 1992

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

context-free languagespaperfolding sequencescontext-free setsequences over a finite alphabet

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (3)

Canonical positions for the factors in paperfolding sequences ⋮ On the context-freeness of the set of words containing overlaps ⋮ About the \(p\)-paperfolding words

Cites Work

• Unnamed Item
• Arithmetic and analytic properties of paper folding sequences
• Uniform tag sequences

This page was built for publication: A result about languages concerning paperfolding sequences