Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete (Q3088039)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete |
scientific article |
Statements
Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete (English)
0 references
17 August 2011
0 references
