Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata

On the power of finite automata with both nondeterministic and probabilistic states (preliminary version)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing

Unary Pushdown Automata and Auxiliary Space Lower Bounds

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science

Unary Language Concatenation and Its State Complexity

CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata

On some variations of two-way probabilistic finite automata models

Theoretical Computer Science

State fusion of fuzzy automata with application on target tracking

Computers & Mathematics with Applications

Closure properties of the classes of sets recognized by space-bounded two-dimensional probabilistic turing machines

Information Sciences: an International Journal

On some variations of two-way probabilistic finite automata models

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory