Containing of Regular Languages in Non-Regular Timing Diagram Languages is Decidable.
Kathi FislerPublished in: CAV (1997)
Keyphrases
- regular languages
- grammatical inference
- context free languages
- regular expressions
- finite automata
- decision problems
- context free grammars
- context free
- pac learning
- positive data
- first order logic
- databases
- finite state machines
- statistical queries
- xml schema
- database systems
- inductive inference
- uniform distribution
- learning problems
- pattern matching
- computational complexity