On some variations of two-way probabilistic finite automata models

DOI10.1016/J.TCS.2007.01.017MaRDI QIDQ880179zbMATH OpenOpenAlexFDO

Authors B. Ravikumar

Publication date 11 May 2007

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

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

zbMATH Keywords

counter machinepebble automatonprobabilistic finite automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On Some Variations of Two-Way Probabilistic Finite Automata Models
• scientific article; zbMATH DE number 1318511
• scientific article; zbMATH DE number 3850478
• A note on two-way probabilistic automata
• A note on two-dimensional probabilistic finite automata
• scientific article; zbMATH DE number 3894479
• Multihead two-way probabilistic finite automata (extended abstract)
• scientific article; zbMATH DE number 2086675
• Stochasticity of the languages acceptable by two-way finite probabilistic automata
• Multihead two-way probabilistic finite automata

Cites work

• scientific article; zbMATH DE number 4180787 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3765145 (Why is no real title available?)
• scientific article; zbMATH DE number 3575000 (Why is no real title available?)
• scientific article; zbMATH DE number 1318511 (Why is no real title available?)
• scientific article; zbMATH DE number 1346510 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
• A lower bound for probabilistic algorithms for finite state machines
• Finite state verifiers I
• On the Power of Finite Automata with both Nondeterministic and Probabilistic States
• On the power of two-way random generators and the impossibility of deterministic poly-space simulation
• Parallel computation for well-endowed rings and space-bounded probabilistic machines
• Probabilistic automata
• Shuffling Cards and Stopping Times
• Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties
• The knowledge complexity of interactive proof-systems
• There is no polynomial deterministic space simulation of probabilistic space with a two-way random-tape generator

Cited in

(3)

• On Some Variations of Two-Way Probabilistic Finite Automata Models
• Adding pebbles to weighted automata: easy specification \& efficient evaluation
• scientific article; zbMATH DE number 1245648 (Why is no real title available?)

This page was built for publication: On some variations of two-way probabilistic finite automata models

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