The language preservation problem is undecidable for parametric event-recording automata.
Étienne AndréShang-Wei LinPublished in: Inf. Process. Lett. (2018)
Keyphrases
- programming language
- formal language theory
- sufficient conditions
- language learning
- finite state machines
- formal languages
- event detection
- neural network
- finite state automaton
- context dependent
- language processing
- target language
- event condition action
- probabilistic automata
- regular languages
- context free
- finite automata
- specification language
- query answering
- news articles
- np complete