Decentralized diagnosability of regular languages is undecidable.
Raja SenguptaStavros TripakisPublished in: CDC (2002)
Keyphrases
- regular languages
- context free languages
- grammatical inference
- regular expressions
- finite automata
- decision problems
- positive data
- context free grammars
- sufficient conditions
- pac learning
- context free
- finite state machines
- pattern matching
- query language
- decision trees
- context dependent
- positive and negative
- theoretical analysis
- equivalence queries
- active learning