Login / Signup
Structural complexity of multi-valued partial functions computed by nondeterministic pushdown automata.
Tomoyuki Yamakami
Published in:
ICTCS (2014)
Keyphrases
</>
multi valued
single valued
finite state
finite automata
bi decomposition
multiple valued
normal form
boolean functions
computational complexity
regular expressions
finite automaton
worst case
endpoints
database
model checking
upper bound
database systems