"Equivalence of deterministic one-counter automata is NL-complete."

Stanislav Böhm, Stefan Göller, Petr Jancar (2013)

> Home

Details and statistics

DOI: 10.1145/2488608.2488626

access: closed

type: Conference or Workshop Paper

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/BohmGJ13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/BohmGJ13
Stanislav Böhm, Stefan Göller, Petr Jancar:
Equivalence of deterministic one-counter automata is NL-complete. STOC 2013: 131-140

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.