The language preservation problem is undecidable for parametric event-recording automata (Q1751409): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.ipl.2018.03.013 / rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q130085686 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.IPL.2018.03.013 / rank | |||
Normal rank |
Latest revision as of 08:12, 11 December 2024
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