Reversible languages having finitely many reduced automata.
Kitti GelleSzabolcs IvánPublished in: AFL (2017)
Keyphrases
- cellular automata
- markov chain
- finite number
- databases
- regular languages
- language independent
- cross lingual
- finite state
- text summarization
- formal language theory
- expressive power
- regular expressions
- significantly reduced
- tree automata
- context free
- database
- finite state machines
- data sets
- finite automata
- integrity constraints
- probabilistic automata
- lattice gas