Regularity Conditions for Iterated Shuffle on Commutative Regular Languages.
Stefan HoffmannPublished in: CIAA (2021)
Keyphrases
- protein sequences
- regular languages
- regular expressions
- context free languages
- grammatical inference
- decision problems
- finite automata
- context free grammars
- context free
- sufficient conditions
- decision makers
- pac learning
- special case
- positive data
- machine learning algorithms
- matching algorithm
- integrity constraints
- objective function
- machine learning