The language preservation problem is undecidable for parametric event-recording automata.
Étienne AndréShang-Wei LinPublished in: CoRR (2018)
Keyphrases
- programming language
- language learning
- formal language theory
- sufficient conditions
- finite state machines
- event detection
- natural language
- context free
- event driven
- neural network
- news articles
- parametric models
- data exchange
- finite state
- language processing
- object oriented programming
- specification language
- cellular automata
- finite automata
- state space
- lattice gas