scientific article; zbMATH DE number 1318511

MaRDI QIDQ4256643zbMATH OpenFDO

Authors B. Ravikumar

Publication date 8 August 1999

zbMATH Keywords

2-way probabilistic finite automatabounded semilinear languagesclosure propertieslanguages accepted by deterministic blind counter machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• A note on two-way probabilistic automata
• On some variations of two-way probabilistic finite automata models
• A note on two-dimensional probabilistic finite automata

Cited in

(17)

• Alternation with a pebble
• A note on two-way probabilistic automata
• A note on two-dimensional probabilistic finite automata
• Accepting runs in a two-way finite automaton
• On partially blind multihead finite automata.
• On the power of finite automata with both nondeterministic and probabilistic states (preliminary version)
• A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
• On Some Variations of Two-Way Probabilistic Finite Automata Models
• Stochasticity of the languages acceptable by two-way finite probabilistic automata
• scientific article; zbMATH DE number 176733 (Why is no real title available?)
• scientific article; zbMATH DE number 1245648 (Why is no real title available?)
• On the Power of Finite Automata with both Nondeterministic and Probabilistic States
• scientific article; zbMATH DE number 1857649 (Why is no real title available?)
• Sampling a two-way finite automaton
• A lower bound for probabilistic algorithms for finite state machines
• Multihead two-way probabilistic finite automata
• On some variations of two-way probabilistic finite automata models

This page was built for publication:

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