
	Where results make sense

Topic: Alternating finite automaton

Related Topics

Finite state machine

Formal language

Transition

Propositional calculus

Chinese remainder theorem

Permutation

Stephen Kleene

In the News (Mon 6 Jul 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Kids.Net.Au - Encyclopedia > Finite state automaton (Site not responding. Last check: 2007-10-14)
		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).
		Finite automata may operate on languages of finite words (the standard case), infinite words (Rabin automata, Büchi automata[?]), or various types of trees (tree automata), to name the most important cases.
		Apart from theory, finite state machines occur also in hardware circuits, where the input, the state and the output are bit vectors of fixed size (Moore and Mealy machines).
	encyclopedia.kids.net.au /page/fi/Finite_state_automaton (856 words)

	Finite Nature - Fredkin essay
		Alternate molecules are in a FCC-structure - and Fredkin describes alternate cells as "past" and "current" states - but both are necessary to determine the future state.
		While alternate molecules are in a FCC-structure, that does not mean the resulting automaton is best described as having the properties and geometry associated with FCC structures.
		I consider a cell to be a single cube - and consider the automaton to have a cubic rule - with different rules applied in alternating cells.
	finitenature.com /fredkin_essay (770 words)

	OmniMark White Papers
		As described earlier a Finite State Machine is a machine with a finite number of states, with a set of rules of the form "if, when in state X, the next symbol is Y, then go to state Z" or "if, when in state X, there are no more symbols, the string is recognized".
		A Deterministic Finite Automaton, or DFA, is a Finite State Machine that for each combination of state X and symbol Y has only one rule of the first form.
		A Finite State Machine that allows a symbol to put it into two or more states is called a Nondeterministic Finite Automaton, or NFA.
	www.oasis-open.org /cover/omnimarkContentModelAlgebra200101.html (3466 words)

	Regular language - Wikipedia, the free encyclopedia
		A regular language is a formal language (i.e., a possibly infinite set of finite sequences of symbols from a finite alphabet) that satisfies the following equivalent properties:
		If Σ is a finite alphabet and Σ* denotes the free monoid over Σ consisting of all strings over Σ, f : Σ* → M is a monoid homomorphism where M is a finite monoid, and S is a subset of M, then the set f
		The language L is regular if and only if the number of equivalence classes of ~ is finite; if this is the case, this number is equal to the number of states of the minimal deterministic finite automaton accepting L.
	en.wikipedia.org /wiki/Regular_language (646 words)

	MFCS'93 information booklet, plain text.
		The result is a distributed semantics which yields finite transition systems for all CCS processes with a regular behaviour.
		We argue that the synchronized alternating finite automaton (SAFA) is a viable model for studying the communication complexity of parallel computation.
		We consider finite periodic graphs} G^m defined by nonnegative integer vectors m and directed graphs G whose edges are labeled with integer vector-weights.
	www.cis.upenn.edu /~bcpierce/types/archives/1993/msg00091.html (7057 words)

	James Mc Parlane's Blog - Parsing Theory (Site not responding. Last check: 2007-10-14)
		On this view, the automaton generates a formal language, which is a set of strings.
		The two views of automata are equivalent: the function that the automaton computes is precisely the characteristic function of the set of strings it recognized.
		The class of languages generated by finite automata is known as the class of regular languages.
	blog.metawrap.com /blog/CategoryView,category,Parsing%20Theory.aspx (4278 words)

	Complexity International
		Every automaton in the grid has the same number of neighbours, transition mapping and set of possible and final states [11], but they may differ from other automata in the grid only in their initial states.
		The input to the automaton associated to a given point in the grid is the set of states of the automata associated to its neighbours.
		The cellular automaton we shall consider shows the following characteristics: the grid is rectangular and possibly infinite; the only neighbour of each cell is the cell itself; a finite automaton is associated to each cell of the grid.
	journal-ci.csse.monash.edu.au /ci_louise/vol07/alfons01/html (4675 words)

	Finite-state automata and directed acyclic graphs (Site not responding. Last check: 2007-10-14)
		Alternating finite automata (AFA) are an extension of NFA (nondeterministic finite automata).
		A cover automaton for a finite language L is a finite automaton that accepts all words in L and possibly other words that are longer than any word in L.
		In other words, a cover automaton is a cyclic automaton and a counter (the maximal length of words) replacing an acyclic automaton (since L is final, a DFA for L is acyclic) in order to reduce the number of states.
	odur.let.rug.nl /alfa/Alfa-informatica/fsa_stuff (5733 words)

	Finite state machine - Wikipedia
		Alternating automata also provide a dual notion, where for acceptance all nondeterministic computations must accept.
		A finite state machine can be implemented in software with a state transition matrix (in some cases a sparse matrix implemented with linkedd lists or a huge switch-statement for detecting the internal state and then individual switch statements for decoding the input symbol.
		In hardware a fsm may be directly implemented using a Programmable logic device.
	condor.depaul.edu /~ichu/csc415/notes/notes10/fsa.htm (696 words)

	ESSLLI 2001 Programme
		Finite model theory can be succinctly described as the study of expressive power of logical languages on classes of finite structures.
		This is the key idea of a branch of finite model theory, known as descriptive complexity theory.
		The aim of this workshop is to bring together researchers from the fields of Automata theory and formal languages, on one hand, and from Finite model theory and descriptive complexity, on the other hand, and to explore connections between these fields.
	www.helsinki.fi /esslli/workshops/AFMT.html (285 words)

	11 Finite State (Site not responding. Last check: 2007-10-14)
		An alternate way to define the language accepted by a finite-state acceptor is through a grammar.
		This automaton would be regarded as non-deterministic, since the next state given input 0 is not determined.
		All three of the regular operators (juxtaposition, alternation, and iteration) were used in grammars earlier.
	www.cs.hmc.edu /claremont/keller/webBook/ch12 (10653 words)

	School of Computing, Queen's University (Site not responding. Last check: 2007-10-14)
		State-complexity of finite automata: In many new application areas of finite automata, such as state-charts in object-oriented modeling or finite-state transducers in natural language processing, automata with thousands or even millions of states are needed.
		Salomaa's work deals with the nondeterminism degree of pushdown automata which according to our results is more meaningful and useful in practice than the nondeterminism measures considered earlier, for instance, it is more compatible with the complexity of parsing.
		He investigates the tradeoffs between the nondeterminism degree and the state-complexity of pushdown automata, that is, what happens when the amount of nondeterminism used in the computation and the size of the automaton is restricted simultaneously.
	www.cs.queensu.ca /researchreport/faculty/salomaa.html (305 words)

	Math 670 Fall 1998 MWF 10:30-12 DRL 4C4
		Finish the proof that the construction given in class of the alternating Büchi automaton associated to a given temporal formula has the desired property that the automaton accepts an infinite word iff this word when considered as a temporal model satisfies the formula.
		In each case prove in detail that the infinitary language of the alternating Büchi automaton is precisely the set of linear temporal logic models satisfying the formula.
		Prove in detail PSPACE-hardness of the satisfiablity problem for linear temporal logic by describing a logarithmic-space algorithm that given a PSPACE-bounded Turing machine M and a finite word w outputs a linear temporal logic formula such that the formula is satisfiable iff M accepts w.
	www.cis.upenn.edu /~scedrov/courses/Math670F98.html (458 words)

	AFA
		This page concerning a three-letter acronym or abbreviation is a disambiguation page — a navigational aid which lists other pages that might otherwise share the same title.
		Therapist's records sought in AFA sex assault case
		, head of the 2.2 million member AFA, boasts on his organizations Web site that the "boycott continues to be effective," citing a 11.6 percent drop in Ford sales for the month of August.
	www.measuroo.com /Acr-A/AFA.php (172 words)

	AFA \| English \| Dictionary & Translation by Babylon
		AFA in 13 languages, encyclopedia term for AFA.
		Afa (mythology) in the Polynesian mythology of Samoa.
		AFA to French AFA to Italian AFA to Spanish AFA to Dutch AFA to Portuguese AFA to German AFA to Japanese AFA to Hebrew AFA to Additional
	www.babylon.com /definition/AFA/English (142 words)

	REX: XML Shallow Parsing with Regular Expressions
		An ASCII-based automaton without counting is a deterministic finite automaton over a character set that includes the 7-bit ASCII set as a subset and meets the constraints that (a) all super-ASCII transitions are total, and (b) all super-ASCII acceptance states include a super-ASCII self transition.
		In essence, constraint (a) means that the automaton is ASCII-based, that is, transition decisions are based on the presence or absence of specific 7-bit ASCII characters.
		In essence, the automaton is being applied to the octet stream of the UTF-8 document which is not necessarily the same as the character stream.
	www.cs.sfu.ca /~cameron/REX.html (8474 words)

	Alternating finite automaton - Wikipedia, the free encyclopedia
		In automata theory, an alternating finite automaton (AFA) is a non-deterministic finite automaton whose transitions are divided into existential and universal transitions.
		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).
		An alternative model which is frequently used is the one where Boolean combinations are represented as clauses.
	en.wikipedia.org /wiki/Alternating_finite_automaton (210 words)

	DBLP: Sheng Yu
		Nicolae Santean, Sheng Yu: On Weakly Ambiguous Finite Transducers.
		Kai Salomaa, Sheng Yu: Alternating finite automata and star-free languages.
		Arto Salomaa, Sheng Yu: On the decomposition of finite languages.
	www.vldb.org /dblp/db/indices/a-tree/y/Yu:Sheng.html (1394 words)

	FLoC 2006 - CAV
		In contrast to the standard algorithm, which uses the subset construction to explicitly determinize the automaton, we keep the determinization step implicit.
		We also show how variations of the antichain method can be used for solving the language inclusion problem for nondeterministic finite automata, and the emptiness problem for alternating finite automata.
		However, analogous to the use of BDDs to represent finite sets, the sizes of the automata are an obstacle in the automata-based set representation.
	www.easychair.org /FLoC-06/CAV-day228.html (1615 words)

	Finkbeiner/Sipma: Checking Finite Traces using Alternating Automata (Site not responding. Last check: 2007-10-14)
		We present three algorithms to check at runtime whether a reactive program satisfies a temporal specification, expressed by a future linear-time temporal logic formula.
		The three methods are all based on alternating automata, but traverse the automaton in different ways: depth-first, breadth-first, and backwards, respectively.
		All three methods have been implemented and experimental results are presented.
	theory.stanford.edu /~sipma/papers/rv01.html (83 words)

	ETH - ITE - Publications in Refereed Journals
		Hromkovic, J.: On one-way two-head deterministic finite state automata.
		Hromkovic, J.: Fooling a two-way nondeterministic automaton with reversal number restriction.
		Hromkovic, J.: Alternating multicounter machines with constant number of reversals.
	www.ite.ethz.ch /people/hromkovic/publications/articles (1513 words)

	lecture notes on regular language -
		If S is a finite alphabet and S* denotes the free monoid over S consisting of all strings over S, f : S* ?
		M is a monoid homomorphism where M is a finite monoid, and S is a subset of M, then the set f
		If L is any subset of S, one defines an equivalence relation ~ on S as follows: u ~ v is defined to mean
	www.infotechloco.com /Inf-Computer-Topics-R---Sx/Regular-language.html (517 words)

	Conference on Implementation and Application of Automata
		Algebraic Hierarchical Decomposition of Finite State Automata: Comparison of Implementations for Krohn-Rhodes Theory
		Finite Automata for Compact Representation of Language Models in NLP
		Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set
	wotan.liu.edu /docis/dbl/wiawia (1347 words)

	Extended Regular Expressions and Temporal Logic (Site not responding. Last check: 2007-10-14)
		ERE systems such as the RE packages in Java and Perl are not on-line; they require the storage of the ever growing input stream, thereby requiring potentially large amounts of memory and monotonically decreasing performance.
		The best known method for executing ERE involves translation into Alternating Finite Automata (AFA), and conversion of the AFA to a Nondeterministic Finite automaton (NFA).
		The resulting NFA is exponential in the size of the original ERE, thereby resulting in an exponential executing system for the original ERE.
	www.time-rover.com /ere.html (312 words)

	DBLP: Juraj Hromkovic
		Juraj Hromkovic, Georg Schnitger: Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation.
		Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert: Measures of Nondeterminism in Finite Automata.
		Pavol Duris, Juraj Hromkovic: One-Way Simple Multihead Finite Automata are not Closed Under Concatenation.
	www.informatik.uni-trier.de /~ley/db/indices/a-tree/h/Hromkovic:Juraj.html (2037 words)

	Contents of the first edition
		Formal definition of a finite automaton - Examples of finite automata - Formal definition of computation - Designing finite automata - The regular operations
		Formal definition of a pushdown automaton - Examples of pushdown automata - Equivalence with context-free grammars
		Alternating time and space - The Polynomial time hierarchy
	www-math.mit.edu /~sipser/itoc-1and2.html (328 words)

	DBLP: Kai Salomaa
		George Rahonis, Kai Salomaa: On the Size of Stack and Synchronization Alphabets of Tree Automata.
		Kai Salomaa: Representation of Recursively Enumerable Languages Using Alternating Finite Tree Recognizers.
		Kai Salomaa: Yield-Languages Recognized by Alternating Tree Recognizers.
	www.informatik.uni-trier.de /~ley/db/indices/a-tree/s/Salomaa:Kai.html (966 words)

	Regular language (Site not responding. Last check: 2007-10-14)
		a possibly infinite set of finite sequences of symbols from a finite alphabet) that satisfies the following equivalent properties:
		If Σ is a finite alphabet and Σ
		denotes the free monoid over Σ consisting of all strings over Σ, ''f'' : Σ* → M is a monoid homomorphism where M is a finite monoid, and S is a subset of M, then the set f
	regular-language.kiwiki.homeip.net (604 words)

Try your search on: Qwika (all wikis)