Automata-Theoretical Regularity Characterizations for the Iterated Shuffle on Commutative Regular Languages.
Stefan HoffmannPublished in: DLT (2022)
Keyphrases
- regular languages
- regular expressions
- finite automata
- grammatical inference
- context free languages
- decision problems
- context free grammars
- pac learning
- positive data
- finite state automata
- finite state machines
- theoretical analysis
- context free
- pattern matching
- matching algorithm
- special case
- query language
- context sensitive
- query evaluation
- uniform distribution
- xml schema
- supervised learning