Login / Signup
Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness.
Mathieu Caralp
Pierre-Alain Reynier
Jean-Marc Talbot
Published in:
Developments in Language Theory (2012)
Keyphrases
</>
sufficient conditions
finite state
finite automata
cellular automata
linear combination
regular expressions
model checking
probabilistic automata
finite state machines
tree automata
lattice gas
datalog programs
decision trees
multiscale
video sequences
automata theoretic