Enumerating nondeterministic automata for a given language without constructing the canonical automaton.
Jean-Marc ChamparnaudFabien CoulonPublished in: Int. J. Found. Comput. Sci. (2005)
Keyphrases
- finite automaton
- finite automata
- finite state automaton
- tree automata
- regular languages
- finite state machines
- turing machine
- finite state automata
- finite state
- probabilistic automata
- regular expressions
- programming language
- deterministic automata
- formal language theory
- deterministic finite automata
- formal languages
- cellular automata
- pattern matching
- natural language
- computational linguistics
- genetic algorithm
- machine learning
- english language
- grammatical inference
- specification language
- database
- target language
- language processing
- language learning
- artificial intelligence
- learning algorithm
- tree languages
- neural network
- data sets