Preliminary version in Proc. COLT'94.In 1987, D. Angluin presented an algorithm that exactly learns regular languages represented by deterministic finite automata (dfa) from Membership and Equivalence queries. Furthermore, the algorithm is feasible in the sense that it takes time O(n^2m^2), where n is the number of states of the automaton and m is the length of the longest counterexample to an Equivalence query. This paper studies whether parallelism can lead to substantially more efficient algorithms for the problem. We show that no CRCW PRAM machine using a number of processors polynomial in n and m can identify dfa in o(n/log n) time. Furthermore, this lower bound is tight: we develop a CRCW PRAM learning algorithm that uses polynomially...
AbstractLearning regular languages from queries was introduced by Angluin in a seminal paper that al...
We introduce and explore a model for parallel learning of families of languages computable by finite...
In this paper, we establish the learnability of simple deterministic finite-memory automata via memb...
Preliminary version in Proc. COLT'94.In 1987, D. Angluin presented an algorithm that exactly learns ...
Sequential algorithms given by Angluin (1987) and Schapire (1992) learn deterministic finite automat...
It is known that the class of deterministic finite automata is polynomial time learnable by using m...
It is known that the class of deterministic finite automata is polynomial time learnable by using me...
This paper is focused on learning deterministic finite automata (DFA) within the framework of query ...
In this survey we compare several known variants of the algorithm for learning deterministic finite ...
We present an efficient incremental algorithm for learning deterministic finite state automata (DFA)...
The present paper establishes the learnability of simple deterministic finite-memory automata via me...
Abstract. We investigate the computational complexity of the nondeterministic finite automaton (NFA)...
The present paper establishes the learnability of simple deterministic finitememory automata via mem...
We investigate the learning problem of two-tape deterministic finite automata(2tape DFAs) from queri...
AbstractThe paper discusses the problem of the induction of a minimal nondeterministic finite automa...
AbstractLearning regular languages from queries was introduced by Angluin in a seminal paper that al...
We introduce and explore a model for parallel learning of families of languages computable by finite...
In this paper, we establish the learnability of simple deterministic finite-memory automata via memb...
Preliminary version in Proc. COLT'94.In 1987, D. Angluin presented an algorithm that exactly learns ...
Sequential algorithms given by Angluin (1987) and Schapire (1992) learn deterministic finite automat...
It is known that the class of deterministic finite automata is polynomial time learnable by using m...
It is known that the class of deterministic finite automata is polynomial time learnable by using me...
This paper is focused on learning deterministic finite automata (DFA) within the framework of query ...
In this survey we compare several known variants of the algorithm for learning deterministic finite ...
We present an efficient incremental algorithm for learning deterministic finite state automata (DFA)...
The present paper establishes the learnability of simple deterministic finite-memory automata via me...
Abstract. We investigate the computational complexity of the nondeterministic finite automaton (NFA)...
The present paper establishes the learnability of simple deterministic finitememory automata via mem...
We investigate the learning problem of two-tape deterministic finite automata(2tape DFAs) from queri...
AbstractThe paper discusses the problem of the induction of a minimal nondeterministic finite automa...
AbstractLearning regular languages from queries was introduced by Angluin in a seminal paper that al...
We introduce and explore a model for parallel learning of families of languages computable by finite...
In this paper, we establish the learnability of simple deterministic finite-memory automata via memb...