RATIONAL APPROXIMATIONS OF POLYNOMIAL FACTORIAL LANGUAGES

DOI10.1142/S0129054107004887MaRDI QIDQ3444851zbMATH OpenFDO

Authors Arseny M. Shur

Publication date 5 June 2007

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054107004887

zbMATH Keywords

finite antidictionaries

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Factorial Languages of Low Combinatorial Complexity
• Polynomial languages with finite antidictionaries
• LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS
• scientific article; zbMATH DE number 6503311
• On the existence of regular approximations

Cites work

• Automata and forbidden words
• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• Repetition-free words
• Uniformly growing k-th power-free homomorphisms

Cited in

(7)

• On intermediate factorial languages
• Factorial languages with quadratically upper bounded growth functions and nonlinearly upper bounded subword complexities
• Factorial Languages of Low Combinatorial Complexity
• scientific article; zbMATH DE number 522861 (Why is no real title available?)
• scientific article; zbMATH DE number 222191 (Why is no real title available?)
• On the growth rates of complexity of threshold languages
• On the ratio of growth functions in EDTOL languages

This page was built for publication: RATIONAL APPROXIMATIONS OF POLYNOMIAL FACTORIAL LANGUAGES

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