NON-CONSTRUCTIVE METHODS FOR FINITE PROBABILISTIC AUTOMATA

DOI10.1142/S0129054108005826MaRDI QIDQ3538850zbMATH OpenFDO

Authors Rūsiņš Freivalds

Publication date 24 November 2008

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054108005826

zbMATH Keywords

quantum finite automatasize of finite probabilistic automata

Mathematics Subject Classification ID

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

Recommendations

• Non-constructive Methods for Finite Probabilistic Automata
• Profinite techniques for probabilistic automata
• scientific article; zbMATH DE number 3499660
• Algebraic properties of probabilistic finite automata
• Probabilistic Büchi automata with non-extremal acceptance thresholds
• Methods for quantitative analysis of probabilistic pushdown automata
• Profinite techniques for probabilistic automata and the Markov monoid algorithm
• Decidable and expressive classes of probabilistic automata
• Decidable and expressive classes of probabilistic automata
• Probabilistic ω-automata

Cites work

• ARTIN'S CONJECTURE FOR PRIMITIVE ROOTS
• scientific article; zbMATH DE number 918133 (Why is no real title available?)
• Probabilistic automata
• Riemann's hypothesis and tests for primality
• Some aspects of probabilistic automata
• Theory of transmission of information

Cited in

(9)

• Amount of nonconstructivity in deterministic finite automata
• Multiple usage of random bits in finite automata
• Ultrametric algorithms and automata
• Quantum automata theory -- a review
• Amount of Nonconstructivity in Finite Automata
• Exponentially more concise quantum recognition of non-RMM regular languages
• Non-constructive Methods for Finite Probabilistic Automata
• Ultrametric automata and Turing machines
• Probabilistic input-driven pushdown automata

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 Q3538850)