Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete.
Stanislav BöhmStefan GöllerPublished in: MFCS (2011)
Keyphrases
- real time
- finite state automaton
- natural language
- linguistic knowledge
- turing machine
- formal language
- formal languages
- vision system
- finite state
- low cost
- formal language theory
- closed world
- finite state machines
- language learning
- cellular automata
- high speed
- state space
- regular expressions
- real time systems
- representation language
- pattern matching
- np complete
- logic programming
- programming language