Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata.

Daniel Kirsten Sylvain Lombardy

Published in: STACS (2009)

Keyphrases

np complete
cellular automata
probabilistic automata
finite automata
lattice gas
regular expressions
tree automata
finite state machines
finite state
dnf formulas
pac learning
sample complexity
finite automaton
hypothesis space
real time
pattern matching
active learning
real world