Synchronizing deterministic push-down automata can be really hard (Q6186317)
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 7798816
| 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 7798816 |
Statements
Synchronizing deterministic push-down automata can be really hard (English)
0 references
2 February 2024
0 references
synchronization
0 references
complexity
0 references
deterministic push-down automata
0 references
0 references
0 references
0.998815894126892
0 references
0.8065472841262817
0 references
0.8056086897850037
0 references
0.7993886470794678
0 references
0.7874687314033508
0 references
