| J04-2005 | addition of sorted strings to a | cyclic automaton | . First , the role of a data |
| J04-2005 | algorithm for adding strings to a | cyclic automaton | has been presented . It is faster |
| J04-2005 | 2002 ) . In both experiments , a | cyclic automaton | was created . It recognized any |
| J04-2005 | was used to construct an initial | cyclic automaton | recognizing any sequence of words |
| J04-2005 | common prefix path . In case of a | cyclic automaton | , we do not start from scratch |
| J04-2005 | can be seen as an extension to | cyclic automata | of the algorithm for unsorted |
| C04-1013 | results of ( Ron et al. , 1995 ) to | cyclic automata | and thus to in nite languages |
| J04-2005 | to a minimal , deterministic , | cyclic automaton | presented in Carrasco and Forcada |
| P04-1058 | and Oncina , 1994 ) ; it learns | cyclic automata | with the so-called state-merging |
| W04-1304 | . This work can be extended to | cyclic automata | ( Clark and Thollard , 2004a |
| J02-2004 | of strings to the languages of | cyclic automata | ( in practice , it may be convenient |
| J04-2005 | of a minimal , deterministic , | cyclic automaton | , and one for incremental removal |
