Normal forms for unary probabilistic automata

DOI10.1051/ITA/2012017MaRDI QIDQ4649454zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Maria Paola Bianchi, Giovanni Pighizzini

Publication date 22 November 2012

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=ITA_2012__46_4_495_0/

zbMATH Keywords

normal formprobabilistic automataunary languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Chrobak normal form revisited, with applications
• Mathematical Foundations of Computer Science 2003
• scientific article; zbMATH DE number 1747446
• On the size of unary probabilistic and nondeterministic automata
• Finite automata and unary languages

Cited in

(3)

• Chrobak normal form revisited, with applications
• Complexity of promise problems on classical and quantum automata
• Quantum finite automata: advances on Bertoni's ideas

This page was built for publication: Normal forms for unary probabilistic automata

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