| P90-1035 | Stack . The class of corresponding | non-deterministic automata | recognizes exactly the set of |
| H90-1010 | investigated . The class of corresponding | non-deterministic automata | recognizes exactly the set of |
| P94-1028 | This is not the case even for | non-deterministic automata | . Indeed , recognizing a word |
| W11-4405 | restriction ( CR ) constraints into | non-deterministic automata | in finite-state tools and surface |
| W04-1304 | learning with a large alphabet for | non-deterministic automata | , by showing that there are strings |
| W97-1101 | formula is a modification for | non-deterministic automata | of the formula in Patrick and |
| W11-4402 | quadratic ( see ( 2 ) ) . For | non-deterministic automata | , things are much worse : we |
| E09-2008 | minimized whenever possible -- | non-deterministic automata | naturally being easier to inspect |
| W11-4402 | conjecture that deterministic and | non-deterministic automata | are non-equivalent , but still |
| P98-2197 | <title> Transforming Lattices into | Non-deterministic Automata | with Optional Null Arcs </title> |
