Content deleted Content added
m Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Keep majority rating "C" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{WikiProject Computing}}. Tag: |
|||
| (4 intermediate revisions by 3 users not shown) | |||
Line 1:
{{WikiProject banner shell|class=C|
{{WikiProject Computing|importance=|auto=yes}}
}}
==Expanding==
Line 5 ⟶ 8:
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 ==
There is a definition of "alternating finite automaton" in {{cite book | title=Theories of Computability | first=Nicholas | last=Pippenger | publisher=[[Cambridge University Press]] | year=1997 | isbn=0-521-55380-6 | zbl=0879.03013 | pages=93-94 }} 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 {{cite book | title=Automata, Languages and Programming: 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999 Proceedings | volume=1644 | series=Lecture Notes in Computer Science | editor1=Jiri Wiedermann | editor2=Peter van Emde Boas | editor3=Mogens Nielsen | publisher=[[Springer-Verlag]] | year=1999 | isbn=3-540-66224-3 }} This seems similar but again it is not quite clear that they are the same. [[User:Deltahedron|Deltahedron]] ([[User talk:Deltahedron|talk]]) 06:39, 13 October 2012 (UTC)
| |||