Asymptotic approximation by regular languages

DOI10.1007/978-3-030-67731-2_6zbMath1490.68129arXiv2008.01413OpenAlexW3127872916MaRDI QIDQ831785

Ryoma Sin'ya

Publication date: 24 March 2022

Full work available at URL: https://arxiv.org/abs/2008.01413

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Carathéodory extensions of subclasses of regular languages ⋮ On primitive words with non-primitive product ⋮ Measuring power of locally testable languages ⋮ Measuring power of generalised definite languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analytic models and ambiguity of context-free languages
• Prefixes of infinite words and ambiguous context-free languages
• A note on the density of inherently ambiguous context-free languages
• Succinct representations of languages by DFA with different levels of reliability
• On the existence of regular approximations
• On Approximating Non-regular Languages by Regular Languages
• Some properties of disjunctive languages on a free monoid
• The Measure Theoretic Approach to Density
• Minimal cover-automata for finite languages