Commutative Regular Languages with Product-Form Minimal Automata.
Stefan HoffmannPublished in: CoRR (2021)
Keyphrases
- regular languages
- product form
- regular expressions
- finite automata
- steady state
- grammatical inference
- queueing networks
- context free languages
- decision problems
- stationary distribution
- positive data
- context free grammars
- finite state automata
- finite state machines
- pac learning
- state dependent
- pattern matching
- markov chain
- queue length
- special case
- xml schema
- utility function
- background knowledge
- query language
- hidden markov models