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

Stanislav Böhm Stefan Göller Petr Jancar

Published in: STOC (2013)

Keyphrases

finite state automaton
natural language
linguistic knowledge
turing machine
black box
dialogue system
natural language understanding
deterministic automata
database
databases
machine learning
website
randomized algorithms
lattice gas