Commutative Regular Languages with Product-Form Minimal Automata.
Stefan HoffmannPublished in: DCFS (2021)
Keyphrases
- regular languages
- product form
- regular expressions
- finite automata
- steady state
- grammatical inference
- queueing networks
- context free languages
- decision problems
- pac learning
- finite state automata
- stationary distribution
- context free grammars
- state dependent
- markov chain
- positive data
- finite state machines
- uniform distribution
- xml schema
- context free
- arrival rate
- matching algorithm
- pattern matching
- statistical queries
- query language
- equivalence queries
- random walk
- single server
- database
- positive examples
- supervised learning
- probability distribution
- inductive inference