A structural property of regular frequency computations.

DOI10.1016/S0304-3975(01)00213-4MaRDI QIDQ1853730zbMATH OpenFDO

Authors Holger Austinat, Volker Diekert, Ulrich Hertrampf

Publication date 22 January 2003

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

Full work available at URL https://doi.org/10.1016/S0304-3975(01)00213-4

zbMATH Keywords

ComputabilityFrequency computationsRegular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Regular frequency computations
• On the size complexity of deterministic frequency automata
• Structured Frequency Algorithms
• On equality of multiplicity sets of regular languages
• Recognizability and m n-polypodic automata. II

Cites work

• scientific article; zbMATH DE number 3851063 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3711961 (Why is no real title available?)
• scientific article; zbMATH DE number 3304976 (Why is no real title available?)
• Quantifying the amount of verboseness
• Recursion theoretic properties of frequency computation and bounded queries
• Regular frequency computations
• The Theory of Automata, a Survey
• Time bounded frequency computations

Cited in

(6)

• Regular frequency computations
• On the reducibility of sets inside NP to sets with low information content
• Resource Bounded Frequency Computations with Three Errors
• scientific article; zbMATH DE number 2104592 (Why is no real title available?)
• Weak cardinality theorems
• Resource bounded frequency computations with three errors

This page was built for publication: A structural property of regular frequency computations.

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