On shuffle products, acyclic automata and piecewise-testable languages.
Simon HalfonPhilippe SchnoebelenPublished in: CoRR (2018)
Keyphrases
- expressive power
- finite state automata
- language independent
- np hard
- cellular automata
- formal language theory
- regular languages
- context free
- piecewise linear
- grammatical inference
- text summarization
- databases
- probabilistic automata
- formal languages
- database schemes
- finite automata
- np complete
- cross lingual
- regular expressions
- tree automata
- lattice gas
- rational kernels
- query translation
- product recommendation
- xml schema
- data exchange
- special case
- lower bound
- database