Synchronizing deterministic push-down automata can be really hard (Q5089200)
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 7559404
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Synchronizing deterministic push-down automata can be really hard |
scientific article; zbMATH DE number 7559404 |
Statements
18 July 2022
0 references
synchronizing automaton
0 references
reset sequence
0 references
real-time deterministic push-down automaton
0 references
finite-turn push-down automaton
0 references
computability
0 references
computational complexity
0 references
0 references
0 references
0 references
0 references
0.998815894126892
0 references
0.8111649751663208
0 references
0.8088186979293823
0 references
0.802284836769104
0 references
0.7945849895477295
0 references
