A structural property of regular frequency computations.

DOI10.1016/S0304-3975(01)00213-4zbMath1064.68049MaRDI QIDQ1853730

Holger Austinat, Volker Diekert, Ulrich Hertrampf

Publication date: 22 January 2003

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

zbMATH Keywords

ComputabilityRegular languagesFrequency computations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Resource bounded frequency computations with three errors ⋮ Resource Bounded Frequency Computations with Three Errors ⋮ Weak cardinality theorems ⋮ Regular frequency computations ⋮ On the reducibility of sets inside NP to sets with low information content

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Time bounded frequency computations
• Quantifying the amount of verboseness
• Recursion theoretic properties of frequency computation and bounded queries
• The Theory of Automata, a Survey

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