A description based on languages of the final non-deterministic automaton.
Adolfo Ballester-BolinchesEnric Cosme-LlópezRamon Esteban-RomeroPublished in: Theor. Comput. Sci. (2014)
Keyphrases
- deterministic finite automata
- finite state automata
- finite state automaton
- expressive power
- language independent
- deterministic finite automaton
- turing machine
- high level
- black box
- cross lingual
- databases
- state space
- hidden markov models
- real time
- text summarization
- statistical machine translation
- finite automata
- randomized algorithms
- expert systems
- lower bound