Talk:Büchi automaton

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

Mid

This article has been rated as Mid-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Technical Topics

You have written:

you may want to specify a property such as "for every request, an acknowledge eventually follows", or its negation "there is a request which is not followed by an acknowledge". The latter is a property of infinite words: you cannot say of a finite sequence that it satisfies this property.

I don't understand the exact meaning of the latter sentence.

For what I understand, I cannot agree on these phrases. First of all, the two formulas are not one the negation of the other. In particular, "eventually follows" cannot become "not followed by" under negation. I understand this is informal: you do not provide the definition of "eventually" and of the rest. Anyway, either you intend "follows" in one or more "steps" (thus you do not need eventually in the first property) or you intend "follows" in exactly one step (thus, you need something like "never" in the second property). Consider this example (t stands for think, r stands for request, a stands for acknowledge):

s1: trttat

s2: trtttt

s1 and s2 above are two finite sequences. The first formula holds for s1 and the second formula holds for s2. You need to specify better what is the language (logic) in which you express the formulas and their semantics. I would suggest to refer to this article about temporal logic. --Valerios (talk) 15:19, 20 January 2010 (UTC)[reply]

Both in this page and the page on omega-regular languages, the construction that builds a Buchi automaton out of a omega-regular language is not detailed and mentioned as easily obtained from the closure properties of Buchi automata. A pointer would be highly appreciated, or at least some more details. —Preceding unsigned comment added by 146.50.52.129 (talk) 13:47, 11 January 2011 (UTC)[reply]

Pronunciation

What is the proper way to pronounce the name "Büchi "?

B/œ/chi see http://en.wikipedia.org/wiki/German_phonology Soathana 15:43, 12 November 2007 (UTC)[reply]

Thanks. I found examples here. —Preceding unsigned comment added by 79.180.238.116 (talk) 13:13, 19 November 2007 (UTC)[reply]

You are wrong: the pronounciation is B/y/chi, with a Close front rounded vowel, similar as in the plural form of the German word "das Buch": "Die Bücher" (mp3). (I am a native speaker of German.) 84.58.232.143 (talk) 18:04, 3 August 2009 (UTC)[reply]

No Latex please

Most of the articles are written without latex. Please don't change it (Ashutosh Gupta (talk) 16:48, 25 May 2011 (UTC))[reply]