Non-deterministic two-tape automata are more powerful than deterministic ones
Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
Learning regular sets from queries and counterexamples
Information and Computation
Grammatical interface for even linear languages based on control sets
Information Processing Letters
Polynomial Time Learnability of Simple Deterministic Languages
Machine Learning
Algebraic and Automata-Theoretic Properties of Formal Languages
Algebraic and Automata-Theoretic Properties of Formal Languages
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Hi-index | 0.00 |