Login / Signup
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes.
Antonín Kucera
Richard Mayr
Published in:
Inf. Comput. (2010)
Keyphrases
</>
finite state
model checking
computational complexity
stochastic processes
natural language
process model