Finite state verifiers I: the power of interaction
Journal of the ACM (JACM)
How many queries are needed to learn?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
How many queries are needed to learn?
Journal of the ACM (JACM)
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
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
| Hi-index | 0.00 |