On shuffle products, acyclic automata and piecewise-testable languages.
Simon HalfonPhilippe SchnoebelenPublished in: Inf. Process. Lett. (2019)
Keyphrases
- finite state automata
- formal language theory
- language independent
- context free
- expressive power
- np hard
- databases
- np complete
- cellular automata
- regular expressions
- formal languages
- regular languages
- finite state machines
- finite automata
- xml documents
- database schemes
- language identification
- text summarization
- database
- linear model
- rational kernels
- pattern matching