Talk:Generalized Büchi automaton

Merge possibility[edit]

This article should probably be merged with Büchi automata. Narthring (talk • contribs) 16:42, 3 October 2010 (UTC)[reply]

Mearging with Buchi automata wouldn't be a great idea. There is a very important algorithm that translates LTL to GBA. That is needed to be described in this article. In short, there is lots of stuff to talk about GBA. :) I am planning to write it in this page. Soon.(Ashutosh Gupta 08:12, 4 October 2010 (UTC))

Acceptance conditions[edit]

I believe that the discussion of acceptance conditions is a little bit off. The discussion states that there will be 1 or more sets of acceptance states, and that an accepting word must pass through at least one state from each set infinitely often. The problem with this is that it is possible that there will be *zero* acceptance sets, in which case any infinite length path is trivially accepted. But that possibility is ruled out by the requirement in the notation that there be at least one acceptance set.

I'm a bit of a Wikipedia novice, but I will try to correct this. Rpgoldman (talk) 19:48, 29 May 2018 (UTC)[reply]