On Wed, Mar 27, 2019 at 7:46 AM hashim ali <hashim_ali94@outlook.com> wrote:
Hi, Thank you for writing back. I am doing exactly like this. I append cycle{!alive} to my finite word before parsing it to an automaton. but I don't know what should be the length of my prefix i.e. how many steps it should have. I guess its more of a theoretical question, so can you direct me to some source where I can read on this.
For example, if I have a one state automaton my prefix would have only one step e.g. a&b and for two state automaton it may have two steps like this a&b ; a&!b. Is there any method that I can calculate the number of steps.
Why do you assume that such a bound exists? If your automaton has any cycle in the alive part it will recognize words that are arbitrary large. -- Alexandre Duret-Lutz