Equivalence of Deterministic One-Counter Automata is NL-complete

Stanislav Böhm Stefan Göller Petr Jancar

Published in: CoRR (2013)

Keyphrases

finite state automaton
natural language
turing machine
information systems
cellular automata
black box
real time
data sets
social networks
natural language processing
equivalence relation