On the size complexity of deterministic frequency automata

DOI10.1007/978-3-642-37064-9_26MaRDI QIDQ4910466zbMATH OpenOpenAlexFDO

Authors Rūsiņš Freivalds, Thomas Zeugmann, Grant R. Pogosyan

Publication date 18 March 2013

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-37064-9_26

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Regular frequency computations
• scientific article; zbMATH DE number 3956447
• scientific article; zbMATH DE number 1949657
• On the existence of regular approximations
• scientific article; zbMATH DE number 1948503

Cited in

(2)

• Regular frequency computations
• A structural property of regular frequency computations.

This page was built for publication: On the size complexity of deterministic frequency automata

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