On intermediate factorial languages

DOI10.1016/J.DAM.2008.09.007MaRDI QIDQ1028151zbMATHOpenAlexFDO

Authors 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)

Recommendations

• Factorial Languages of Low Combinatorial Complexity
• scientific article; zbMATH DE number 15264
• Commutation of Binary Factorial Languages
• RATIONAL APPROXIMATIONS OF POLYNOMIAL FACTORIAL LANGUAGES
• Factorization in formal languages
• A UNIQUE DECOMPOSITION THEOREM FOR FACTORIAL LANGUAGES
• FACTORIAL LANGUAGES AND SOME COMBINATORIAL PROPERTIES OF SEMIGROUPS
• Simple equations on binary factorial languages
• Factorial languages whose growth function is quadratically upper bounded
• On the Quantized Dynamics of Factorial Languages

Cites work

• scientific article; zbMATH DE number 6004833 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• Hereditary properties of words
• Polynomial languages with finite antidictionaries
• Uniformly growing k-th power-free homomorphisms

Cited in

(4)

• Factorial languages whose growth function is quadratically upper bounded
• Comparing Complexity Functions of a Language and Its Extendable Part
• Palindromic rich words and run-length encodings
• Factorial Languages of Low Combinatorial Complexity

This page was built for publication: On intermediate factorial languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028151)