Login / Signup
The Length of Subset Reachability in Nondeterministic Automata.
Pavel Martyugin
Published in:
Electron. Notes Theor. Comput. Sci. (2008)
Keyphrases
</>
finite automata
finite state
finite automaton
cellular automata
state space
deterministic automata
regular expressions
tree automata
transitive closure
finite state automata
subset selection
markov chain
multiscale
initial set
machine learning
model checking
minimal length
lattice gas
artificial intelligence