User talk:Hebury

Edit at Büchi automaton
Hi Hebury,

I corrected your recent edit at Büchi automaton. In fact, the example was correct: the symbol $$\omega$$ means infinitely many times, so this automaton accepts $$ab$$ repeated infinitely many times. (The definition of acceptance is that the run visits an accepting state infinitely many times, not that it ends in an accepting state since the infinite word in fact never ends.)

Besides a courtesy notice I'm writing to ask if there is anything about the article that could be made clearer, especially in the lead and in the figure, to avoid this confusion? We'd like the article to be a good introduction to the topic that clearly explains the concept. Caleb Stanford (talk) 21:21, 25 June 2022 (UTC)


 * Hi Caleb,
 * I see my mistake now. I don't think it is necessary to make the article more clear, I just read the article too quickly and made an assumption that it should behave similarly to finite automata. Hebury (talk) 13:12, 29 June 2022 (UTC)