The language preservation problem is undecidable for parametric event-recording automata (Q1751409)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The language preservation problem is undecidable for parametric event-recording automata |
scientific article |
Statements
The language preservation problem is undecidable for parametric event-recording automata (English)
0 references
25 May 2018
0 references
formal methods
0 references
formal languages
0 references
parametric timed automata
0 references
event-recording automata
0 references
