Finite state verifiers I: the power of interaction
Journal of the ACM (JACM)
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Minimal cover-automata for finite languages
Theoretical Computer Science
Two-way finite automata with quantum and classical states
Theoretical Computer Science - Natural computing
An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Minimal Cover-Automata for Finite Languages
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
On some variations of two-way probabilistic finite automata models
Theoretical Computer Science
Some Observations on Two-Way Finite Automata with Quantum and Classical States
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues
Probabilistic Acceptors for Languages over Infinite Words
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Theory of one-tape linear-time Turing machines
Theoretical Computer Science
The number of similarity relations and the number of minimal deterministic finite cover automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Reducing acyclic cover transducers
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Learning finite cover automata from queries
Journal of Computer and System Sciences
Journal of the ACM (JACM)
Size complexity of rotating and sweeping automata
Journal of Computer and System Sciences
On some variations of two-way probabilistic finite automata models
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Reduction Techniques for Acyclic Cover Transducers
Fundamenta Informaticae
Finite state verifiers with constant randomness
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Computation with multiple CTCs of fixed length and width
Natural Computing: an international journal
State succinctness of two-way finite automata with quantum and classical states
Theoretical Computer Science
Infinite vs. finite size-bounded randomized computations
Journal of Computer and System Sciences
Proving the Power of Postselection
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
| Hi-index | 0.00 |