The language preservation problem is undecidable for parametric event-recording automata (Q1751409)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6873281
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The language preservation problem is undecidable for parametric event-recording automata |
scientific article; zbMATH DE number 6873281 |
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
0.90341979265213
0 references
0.9001606702804565
0 references
0.7707364559173584
0 references
0.755374550819397
0 references
0.7236483693122864
0 references
