Automata Classes Accepting Languages Whose Commutative Closure is Regular.
Stefan HoffmannPublished in: SOFSEM (2024)
Keyphrases
- regular languages
- closure properties
- context free
- tree automata
- context free languages
- grammatical inference
- finite automata
- regular expressions
- regular tree languages
- expressive power
- context free grammars
- positive data
- context dependent
- finite state automata
- xml schema
- context sensitive
- pac learning
- special case
- finite state machines
- tree languages
- databases
- inductive inference
- query language
- data sets
- query translation
- finite state
- knowledge base