Factorial languages with quadratically upper bounded growth functions and nonlinearly upper bounded subword complexities

DOI10.1016/0020-0190(89)90055-0zbMATH Open0678.68064OpenAlexW2066262281MaRDI QIDQ1124353FDOQ1124353

Authors: Gerd Baron, Friedrich J. Urbanek 

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90055-0

Recommendations

• Factorial languages whose growth function is quadratically upper bounded
• Quotient complexity of bifix-, factor-, and subword-free regular languages
• Quotient complexity of bifix-, factor-, and subword-free regular languages
• On the Quantized Dynamics of Factorial Languages
• On the computation of quotients and factors of regular languages
• Factorial Languages of Low Combinatorial Complexity
• RATIONAL APPROXIMATIONS OF POLYNOMIAL FACTORIAL LANGUAGES
• scientific article; zbMATH DE number 15264
• Context-free languages of sub-exponential growth
• scientific article; zbMATH DE number 3872713

zbMATH Keywords

formal languagesgrowth functionsubword complexityfactorial languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Factorial languages whose growth function is quadratically upper bounded

Cited In (5)

• On possible growths of Toeplitz languages
• Comparing Complexity Functions of a Language and Its Extendable Part
• On the Quantized Dynamics of Factorial Languages
• Title not available (Why is that?)
• Factorial languages whose growth function is quadratically upper bounded

This page was built for publication: Factorial languages with quadratically upper bounded growth functions and nonlinearly upper bounded subword complexities

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