On intermediate factorial languages

DOI10.1016/J.DAM.2008.09.007zbMath1187.68303OpenAlexW1967132305MaRDI QIDQ1028151

Arseny M. Shur

Publication date: 30 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.09.007

zbMATH Keywords

combinatorial complexityintermediate complexityfactorial languagesweb-like automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Comparing Complexity Functions of a Language and Its Extendable Part ⋮ Palindromic rich words and run-length encodings

Cites Work

• Uniformly growing k-th power-free homomorphisms
• Polynomial languages with finite antidictionaries
• Hereditary properties of words
• Unnamed Item
• Unnamed Item

This page was built for publication: On intermediate factorial languages