equal
deleted
inserted
replaced
28 For example, if the language consists just of the word <KBD>ab</KBD>, the |
28 For example, if the language consists just of the word <KBD>ab</KBD>, the |
29 input <KBD>ababaab</KBD> is partitioned into a chopped up prefix |
29 input <KBD>ababaab</KBD> is partitioned into a chopped up prefix |
30 <KBD>[ab,ab]</KBD> and the suffix <KBD>aab</KBD>. |
30 <KBD>[ab,ab]</KBD> and the suffix <KBD>aab</KBD>. |
31 <P> |
31 <P> |
32 |
32 |
33 The auto_chopper is implemented in theory AutoChopper. The top part of the |
33 The auto_chopper is implemented in theory AutoChopper. An alternative (more |
34 diagram, i.e. the translation of regular expressions into deterministic |
34 efficient) version is defined in AutoChopper1. However, no properties have |
35 finite automata is still missing. <P> |
35 been proved for it yet. |
36 |
36 |
|
37 The top part of the diagram, i.e. the translation of regular expressions into |
|
38 deterministic finite automata is still missing (although we have some bits |
|
39 and pieces). |
|
40 <P> |
|
41 |
|
42 The directory also contains Regset_of_auto, a theory describing the |
|
43 translation of deterministic automata into regular sets. |
37 </BODY> |
44 </BODY> |
38 </HTML> |
45 </HTML> |