Equivalence of deterministic one-counter automata is NL-complete (Q5495783)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Equivalence of deterministic one-counter automata is NL-complete |
scientific article; zbMATH DE number 6326947
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Equivalence of deterministic one-counter automata is NL-complete |
scientific article; zbMATH DE number 6326947 |
Statements
Equivalence of deterministic one-counter automata is NL-complete (English)
0 references
7 August 2014
0 references
computational complexity
0 references
deterministic one-counter automata
0 references
language equivalence
0 references
0.938237965106964
0 references
0.8228247165679932
0 references
0.7818782329559326
0 references
0.762244462966919
0 references
