A Lower Bound For Reversible Automata.
Pierre-Cyrille HéamPublished in: RAIRO Theor. Informatics Appl. (2000)
Keyphrases
- lower bound
- cellular automata
- upper bound
- markov chain
- branch and bound algorithm
- probabilistic automata
- lower and upper bounds
- objective function
- branch and bound
- finite state
- lattice gas
- optimal solution
- worst case
- regular expressions
- finite automata
- upper and lower bounds
- np hard
- finite state machines
- lower bounding
- data sets
- sufficiently accurate
- concept class
- tree automata
- learning theory
- sample complexity
- search space
- neural network