Factorial Languages of Low Combinatorial Complexity

DOI10.1007/11779148_36MaRDI QIDQ3617078zbMATH OpenOpenAlexFDO

Authors Arseny M. Shur

Publication date 26 March 2009

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11779148_36

Mathematics Subject Classification ID

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

Recommendations

• LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS
• scientific article; zbMATH DE number 6503311
• Polynomial languages with finite antidictionaries
• RATIONAL APPROXIMATIONS OF POLYNOMIAL FACTORIAL LANGUAGES
• On intermediate factorial languages

Cited in

(14)

• On intermediate factorial languages
• Factorial languages whose growth function is quadratically upper bounded
• Factorial languages with quadratically upper bounded growth functions and nonlinearly upper bounded subword complexities
• RATIONAL APPROXIMATIONS OF POLYNOMIAL FACTORIAL LANGUAGES
• Combinatorial Complexity of Regular Languages
• Comparing Complexity Functions of a Language and Its Extendable Part
• FACTORIAL LANGUAGES AND SOME COMBINATORIAL PROPERTIES OF SEMIGROUPS
• Growth properties of power-free languages
• On the Quantized Dynamics of Factorial Languages
• scientific article; zbMATH DE number 1916668 (Why is no real title available?)
• Deciding WQO for factorial languages
• Languages with a finite antidictionary: growth-preserving transformations and available orders of growth
• On possible growths of Toeplitz languages
• Subproduct systems and Cartesian systems: new results on factorial languages and their relations with other areas

This page was built for publication: Factorial Languages of Low Combinatorial Complexity

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