Talk:Alternating finite automaton
 | This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Expanding
edithi, i think this topic needs to be more complete. i am currently expanding this article. i'll appreciate any comment/suggestion/correction. so far i got started with the first part of formal definition. will expand more. thank you. Janechii 08:40, 18 January 2007 (UTC)
Hi Janechii, I read your article and i liked it but i want more information on alternating automata. Please edit some more information about the topic or just email me as soon as possible, my address is imranformaths@yahoo.com.
Definition
editThere is a definition of "alternating finite automaton" in Pippenger, Nicholas (1997). Theories of Computability. Cambridge University Press. pp. 93–94. ISBN 0-521-55380-6. Zbl 0879.03013. The definition is in terms of winning strategies in a game and it is not clear whether it is equivalent to the definition given here. There is also a definition in Jiri Wiedermann; Peter van Emde Boas; Mogens Nielsen, eds. (1999). Automata, Languages and Programming: 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999 Proceedings. Lecture Notes in Computer Science. Vol. 1644. Springer-Verlag. ISBN 3-540-66224-3. This seems similar but again it is not quite clear that they are the same. Deltahedron (talk) 06:39, 13 October 2012 (UTC)