Polynomial languages with finite antidictionaries

DOI10.1051/ita:2008028zbMath1166.68026OpenAlexW2091328362WikidataQ125390890 ScholiaQ125390890MaRDI QIDQ3625693

Arseny M. Shur

Publication date: 6 May 2009

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2009__43_2_269_0/

zbMATH Keywords

regular languagecombinatorial complexityfinite antidictionarywed-like automaton

Mathematics Subject Classification ID

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

Related Items (1)

On intermediate factorial languages

Cites Work

• Repetition-free words
• Uniformly growing k-th power-free homomorphisms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial languages with finite antidictionaries