Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L).
Jean-Marc ChamparnaudJean-Philippe DubernardHadrien JeannePublished in: CIAA (2008)
Keyphrases
- finite state automaton
- turing machine
- regular languages
- state space
- deterministic finite automata
- regular expressions
- deterministic finite automaton
- finite automata
- language learning
- test cases
- natural language
- black box
- neural network
- modeling language
- language processing
- context free
- multi agent
- test set
- finite state machines
- programming language
- formal language
- finite state automata
- database systems
- artificial intelligence
- machine learning