On the existence of regular approximations

DOI10.1016/J.TCS.2007.07.032MaRDI QIDQ2465045zbMATH OpenOpenAlexFDO

Authors Brendan Cordy, Kai Salomaa

Publication date 19 December 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2007.07.032

zbMATH Keywords

decidabilitydegree of approximationregular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Regular approximation of CFLs: A grammatical view
• Asymptotic approximation by regular languages
• Regular approximation of context-free grammars through transformation
• scientific article; zbMATH DE number 1123618
• scientific article; zbMATH DE number 522861

Cites work

• Additive distances and quasi-distances between words
• Automaticity. I: Properties of a measure of descriptional complexity
• Efficient Computation of the Relative Entropy of Probabilistic Automata
• scientific article; zbMATH DE number 1123618 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 2087235 (Why is no real title available?)
• scientific article; zbMATH DE number 2201365 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Minimal cover-automata for finite languages
• Succinct representations of languages by DFA with different levels of reliability

Cited in

(16)

• On counting functions and slenderness of languages
• Regular approximation of context-free grammars through transformation
• Regular approximation of CFLs: A grammatical view
• Rough approximations in varieties of regular languages
• On the accuracy of rough approximations of regular languages
• On approximating non-regular languages by regular languages
• scientific article; zbMATH DE number 5148974 (Why is no real title available?)
• RATIONAL APPROXIMATIONS OF POLYNOMIAL FACTORIAL LANGUAGES
• Strongly Regular Grammars and Regular Approximation of Context-Free Languages
• scientific article; zbMATH DE number 522861 (Why is no real title available?)
• scientific article; zbMATH DE number 569758 (Why is no real title available?)
• scientific article; zbMATH DE number 222191 (Why is no real title available?)
• On the size complexity of deterministic frequency automata
• An existence theorem by means of regularization
• Statistical estimation with bounded memory
• Asymptotic approximation by regular languages

This page was built for publication: On the existence of regular approximations

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