
	Where results make sense

Topic: Alternating automaton

Related Topics

finite state automaton

pushdown automaton

Rule 110 cellular automaton

Continuous automaton

Rabin automaton

Alternating automaton

chess playing automaton

nondeterministic finite tree automaton

System Integrated Automaton parser

non deterministic finite automaton

deterministic tree automaton

In the News (Thu 9 Jul 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Finite state machine - Wikipedia
		A finite state machine (FSM) or finite state automaton (FSA) is an abstract machine used in the study of computation and languages that has only a finite, constant amount of memory (the state).
		Alternating automata also provide a dual notion, where for acceptance all nondeterministic computations must accept.
		Formally, a deterministic finite automaton (DFA) consists of an alphabet (Σ), a set of states (S), one of which is chosen as a start state and zero or more as accepting states, and a transition function (T : S × Σ -> S).
	nostalgia.wikipedia.org /wiki/Finite_state_machine (495 words)

	Alternating finite automaton - Encyclopedia, History, Geography and Biography
		In automata theory, an alternating finite automaton (AFA) is a non-deterministic finite automaton whose transitions are divided into existential and universal transitions.
		A accepts a word w, if there exists a run tree on w such that every path ends in an accepting state.
		A basic theorem tells that any AFA is equivalent to an non-deterministic finite automaton (NFA) by performing a similar kind of powerset construction as it is used for the transformation of a NFA to a deterministic finite automaton (DFA).
	www.arikah.net /encyclopedia/Alternating_automaton (208 words)

	[No title] (Site not responding. Last check: 2007-10-29)
		Alternating automata have both existential and universal branching modes and are particularly suitable for specification of programs.
		In a weak alternating automaton, the state space is partitioned into partially ordered sets, and the automaton can proceed from a certain set only to smaller sets.
		Known translations of alternating automata to weak alternating automata involve determinization, and therefore involve a double-exponential blow-up.
	www.cs.huji.ac.il /~ornak/publications/istcs97.abs (157 words)

	Alternating finite automaton -- Facts, Info, and Encyclopedia article (Site not responding. Last check: 2007-10-29)
		Let A be an alternating (A mechanism that can move automatically) automaton.
		For a transition, A nondeterministically chooses to switch the state to either or, reading a.
		A basic theorem tells that any AFA is equivalent to an (additional info and facts about non-deterministic finite automaton) non-deterministic finite automaton (NFA) by performing a similar kind of powerset construction as it is used for the transformation of a NFA to a (additional info and facts about deterministic finite automaton) deterministic finite automaton (DFA).
	www.absoluteastronomy.com /encyclopedia/A/Al/Alternating_finite_automaton.htm (152 words)

	[No title] (Site not responding. Last check: 2007-10-29)
		For branching properties, the framework is known and the two-way alternating automaton is a tree automaton.
		Indeed, the fact that a tree automaton can split to copies and simultaneously read all the paths of the tree has a computational price and is irrelevant for linear properties.
		The input to a path automaton is a tree, but the automaton cannot split to copies and it can read only a single path of the tree.
	www.cse.huji.ac.il /~ornak/publications/cav02.abs (310 words)

	LFCS Theory Seminar -- Tuesday 1999
		Especially alternating automata turned out to be a powerful tool in constructing efficient yet simple to understand decision procedures and directly yield further on-the-fly model checking procedures.
		Specifically, we construct a (linear) alternating Büchi automaton accepting the set of linearisations of traces satisfying the formula at hand.
		Furthermore, we show that the class of linear and trace-consistent alternating Büchi automata corresponds exactly to LTL formulas over Mazurkiewicz traces, lifting a similar result by Löding and Thomas formulated in the framework of LTL over words.
	www.lfcs.inf.ed.ac.uk /events/theory-seminars/01.08.21.html (191 words)

	News & Features: DNA-rule-driven fractals probe biochemical self assembly - computationally & in vitro
		To represent this cellular automaton as a tiling, each local context present in the space—time history must have a corresponding Wang tile whose shape represents the input and output occurring at that location (Figure 1B).
		Whereas execution of a cellular automaton occurs perfectly and synchronously, molecular self-assembly is asynchronous and may have many types of errors.
		Frequently, as in Figure 5E, the identity of obscured or missing tiles was deduced from the neighboring tiles by assuming correct information propagation (the imperfection often being caused by sample preparation or by interaction with the AFM tip rather than by errors during assembly).
	www.iscid.org /boards/ubb-get_topic-f-1-t-000215.html (4500 words)

	/bbs/pub/vfv: CBV DEFENSE, REVISED POINTS ONLY
		automaton whose size is linear in the product of the size of
		automaton, in which case a node for an "eventually" statement
		be captured by a dual-run omega automaton whose size is linear in
	www.eda.org /vfv/hm/0530.html (1244 words)

	Short talks [GAMES RTN] Edinburgh
		Alternating Büchi automata are a natural device for representing LTL specifications succinctly.
		One way to arrive at small nondeterministic Büchi automata in such translations is by minimizing the intermediate alternating Büchi automaton, for instance by quotienting w.r.t.
		We adapt direct and delayed simulation to alternating Büchi automata, using a game-theoretic approach.
	www.games.rwth-aachen.de /Events/Edinburgh/abstracts.html (1493 words)

	Mailgate: comp.doc.techreports: AIB 2002-10 Logics for Mazurkiewicz traces (Site not responding. Last check: 2007-10-29)
		Especially alternating automata turned out to be a powerful tool in constructing efficient yet simple to understand decision procedures and directly yield on-the-fly model checking procedures.
		Specifically, we construct a (linear) alternating Buechi automaton accepting the set of linearizations of those traces satisfying the formula at hand.
		Furthermore, we show that the class of linear and trace-consistent alternating Buechi automata corresponds exactly to LTL formulas over Mazurkiewicz traces, lifting a similar result from Loeding and Thomas formulated in the framework of LTL over words.
	www.mailgate.org /comp/comp.doc.techreports/msg00236.html (304 words)

	[No title] (Site not responding. Last check: 2007-10-29)
		Due to the intricacy of the problem and the exponential blow-up that complementation involves, these algorithms have never been used in practice, even though an effective complementation construction would be of significant practical value.
		Recently, Kupferman and Vardi described a complementation algorithm that goes through weak alternating automata and that seems simpler than previous algorithms.
		Our approach is based on optimizations of both the intermediate weak alternating automaton and the final nondeterministic automaton, and involves techniques of rank and height reductions, as well as direct and fair simulation.
	www.cs.huji.ac.il /~ornak/publications/charme03b.abs (118 words)

	[No title] (Site not responding. Last check: 2007-10-29)
		In accordance with goals of the EVA project, when no contradiction is found, {\tt h1} is also able to produce a proof of security, in the form of an alternating tree automaton describing a finite model.
		The {\tt h1} tool then takes 180 milliseconds to check that the alternating tree automaton it just computed is indeed a model (a proof of security) of the input clauses, hence of the two valid secrecy claims on the protocol, and to output the corresponding Coq proof.
		(This negation is exactly automaton complementation.) The \verb/pldet/ utility determinizes alternating tree automata in Prolog notation, outputting deterministic tree automata in XML syntax.
	wwwtest.sunsite.org.uk /sites/ftp.inria.fr/INRIA/publication/Theses/RAWEB-SV/secsi/secsi2003.tex (12231 words)

	Project-Team - SECSI (Site not responding. Last check: 2007-10-29)
		is also able to produce a proof of security, in the form of an alternating tree automaton describing a finite model.
		produces a 187 transition, 59 state alternating tree automaton as a security proof of the two claimed secrecy requirements that hold (over three).
		tool then takes 180 milliseconds to check that the alternating tree automaton it just computed is indeed a model (a proof of security) of the input clauses, hence of the two valid secrecy claims on the protocol, and to output the corresponding Coq proof.
	www.inria.fr /rapportsactivite/RA2003/secsi2003/module14.html (650 words)

	LTL to Automata (Site not responding. Last check: 2007-10-29)
		This algorithm generates a very weak alternating automaton and then transforms it into a Büchi automaton, using a generalized Büchi automaton as an intermediate step.
		Each automaton is simplified on-the-fly in order to save memory and time.
		The criteria of comparison are the size of the resulting automaton, the time of the computation and the memory used.
	www.liafa.jussieu.fr /~gastin/Articles/Cav01go.html (181 words)

	Joe Hurd: ESSLLI 2001 Trip Report (Site not responding. Last check: 2007-10-29)
		This course was about model checking, where a formula can be shown to be satisfiable by constructing a corresponding automaton A and then exhaustively showing that the language that A accepts is non-empty.
		Games provide the initial intuition for showing that a model satisfies a formula, and the concept of an alternating automaton is introduced precisely to allow a game tree to be captured in a computation.
		The most interesting part of the course for me was a discussion on pattern-matching, where many rewriting patterns may be compiled to a finite automaton for fast matching.
	www.cl.cam.ac.uk /~jeh1004/admin/esslli2001-report.html (604 words)

	PhD Thesis: Model-Checking (Site not responding. Last check: 2007-10-29)
		Recently it has been shown that automata-theoretic model checking for branching time temporal logic is possible by translating the temporal formulas to alternating automata.
		The aim of the work presented here is to show that, in a similar way to the linear time case, this link with automata theory can lead to the development of efficient model checking algorithms for branching time temporal logic.
		model checking the model checking problem reduces to checking the nonemptiness of an alternating tree automaton (more precisely that the language that the automaton recognises is nonempty).
	www.cs.man.ac.uk /fmethods/projects/AHV-PROJECT/node15.html (449 words)

	Games for Modal and Temporal Logics
		A formula can describe an automaton's behaviour, and automata are constructed to accept exactly the word or tree models of a formula.
		The logical problem at hand is then characterised by the question of whether or not the existential player has a winning strategy for the game.
		For example the non-emptiness test for an alternating automaton is nothing more than a 2-player game, while winning strategies for games are very similar to tableaux.
	www.lfcs.informatics.ed.ac.uk /reports/03/ECS-LFCS-03-431/index.html (858 words)

	Unifying Truth and Validity Checking for Temporal Logics (Site not responding. Last check: 2007-10-29)
		The basic idea underlying this approach is that for any formula we can construct an alternating automaton that accepts precisely the models of the formula.
		For linear temporal logics the automaton runs on infinite words while for branching temporal logics the automaton runs on infinite trees.
		The simple combinatorial structures that emerge from the automata-theoretic approach decouple the logical and algorithmic components of truth and validity checking and yield clean and essentially optimal algorithms for both problems.
	www.chapman.edu /~jipsen/luatcs99/info/vardi3.html (109 words)

	Amar Isli
		A Isli, Converting a Büchi alternating automaton to a usual nondeterministic one, the Indian Journal SADHANA, Volume 21 (2), Indian Academy of Sciences, (1996) 213-228.
		B Benhamou and A Isli, Study of Symmetry in Qualitative Temporal Interval Networks, to appear in Proceedings of the 8th International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA), Lecture Notes in Artificial Intelligence, Springer-Verlag, Sozopol, Bulgaria, (1998) 88-101.
		A Isli, Mapping an LPTL formula into a Büchi alternating automaton accepting its models, in Proceedings of the ICTL (International Conference on Temporal Logic) workshop, Bonn, (1994) 85-90.
	www.comp.leeds.ac.uk /spacenet/isli.html (640 words)

	The MERLin Project
		Wynand Winterbach worked on the addition of a cellular automaton class to Grail.
		Here we showed that a super-NFA with k=2 is equivalent to a boolean (alternating) automaton.
		With a generalization of acceptance, we also constructed a 2-state super-NFA with k=3 such that its minimal equivalent DFA has 17 states (that is, strictly more than 2^(2^2)).
	www.cs.sun.ac.za /~lynette/merlin.html (902 words)

	236345 - Automatic Verification Of Programs, Spring2003 - Сообщения (Site not responding. Last check: 2007-10-29)
		Here is an explanation why the acceptance condition is correct.
		Recall that for alternating Buchi automata the set of acceptance states
		Given a run of an alternating automaton, it can be shown that
	webcourse.cs.technion.ac.il /236345/Spring2003/ru/news.html (632 words)

	[No title] (Site not responding. Last check: 2007-10-29)
		This answers a question posed by Kupferman and Vardi.
		The proof of the above lower bound exploits the fact that for every CTL (mu-calculus) formula there exists an equivalent alternating tree automaton of linear size.
		The core of the proof is an involved cut-and-paste argument for alternating tree automata.
	sunsite.informatik.rwth-aachen.de /Publications/AIB/1999/99-07.abstract (164 words)

	God of the Machine
		In defeat, Smoluchowski still offered hope for the possibility that an intelligent demon could succeed where his automaton failed.
		In 1929, Leo Szilard envisioned a series of ingenious mechanical devices that require only minor direction from an intelligent agent.
		And here you need only remember the odd numbers and an alternating series of additions and subtractions.
	www.godofthemachine.com (11678 words)

	DBLP: Xiuming Wu (Site not responding. Last check: 2007-10-29)
		Ask others: ACM DL - ACM Guide - CiteSeer - CSB - Google - HomePageSearch
		Kai Salomaa, Xiuming Wu, Sheng Yu: Efficient Implementation of Regular Languages Using Reversed Alternating Finite Automata.
		Sandra Huerter, Kai Salomaa, Xiuming Wu, Sheng Yu: Implementing Reversed Alternating Finite Automaton (r-AFA) Operations.
	www.vldb.org /dblp/db/indices/a-tree/w/Wu:Xiuming.html (83 words)

Try your search on: Qwika (all wikis)