Language equivalence of deterministic real-time one-counter automata is NL-complete (Q3088039)
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 5940102
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Language equivalence of deterministic real-time one-counter automata is NL-complete |
scientific article; zbMATH DE number 5940102 |
Statements
Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete (English)
0 references
17 August 2011
0 references
0.938237965106964
0 references
0.8770339488983154
0 references
0.8075840473175049
0 references
0.7740717530250549
0 references
0.7692941427230835
0 references
