Non-constructive Methods for Finite Probabilistic Automata

DOI10.1007/978-3-540-73208-2_18MaRDI QIDQ5428229zbMATH OpenOpenAlexFDO

Authors Rūsiņš Freivalds

Publication date 28 November 2007

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73208-2_18

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68)

Recommendations

• NON-CONSTRUCTIVE METHODS FOR FINITE PROBABILISTIC AUTOMATA
• Artin’s Conjecture and Size of Finite Probabilistic Automata
• The complexity of probabilistic versus deterministic finite automata
• The complexity properties of probabilistic automata with isolated cut point
• The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints

Cited in

(4)

• Improved constructions of mixed state quantum automata
• Amount of nonconstructivity in deterministic finite automata
• NON-CONSTRUCTIVE METHODS FOR FINITE PROBABILISTIC AUTOMATA
• scientific article; zbMATH DE number 1245648 (Why is no real title available?)

This page was built for publication: Non-constructive Methods for Finite Probabilistic Automata

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