Regular frequency computations

DOI10.1016/J.TCS.2004.09.007zbMATH Open1078.68073OpenAlexW1987537477MaRDI QIDQ1763697FDOQ1763697

Authors: Holger Austinat, Volker Diekert, Ulrich Hertrampf, Holger Petersen 

Publication date: 22 February 2005

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

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

Recommendations

• A structural property of regular frequency computations.
• Structured Frequency Algorithms
• On the size complexity of deterministic frequency automata
• The power of frequency computation
• Frequency computations and the cardinality theorem

zbMATH Keywords

Regular languagesFrequency computation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• The Theory of Automata, a Survey
• Time bounded frequency computations
• A structural property of regular frequency computations.
• Regular frequency computations
• Title not available (Why is that?)
• Quantifying the amount of verboseness
• Resource Bounded Frequency Computations with Three Errors

Cited In (5)

• On the size complexity of deterministic frequency automata
• A structural property of regular frequency computations.
• Structured Frequency Algorithms
• Parallel learning of automatic classes of languages
• On the influence of technology on learning processes

This page was built for publication: Regular frequency computations

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