In automata theory, an alternating finite automaton (AFA) is a nondeterministic finite automaton whose transitions are divided into existential and universal transitions. For example, let A be an alternating automaton.
For an existential transition , A nondeterministically chooses to switch the state to either or , reading a. Thus, behaving like a regular nondeterministic finite automaton.
For a universal transition , A moves to and, reading a, simulating the behavior of a parallel machine.
Note that due to the universal quantification a run is represented by a run tree. 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 states that any AFA is equivalent to a deterministic finite automaton (DFA), hence AFAs accept exactly the regular languages.
An alternative model which is frequently used is the one where Boolean combinations are in disjunctive normal form so that, e.g., would represent . The state tt (true) is represented by in this case and ff (false) by . This representation is usually more efficient.
Alternating finite automata can be extended to accept trees in the same way as tree automata, yielding alternating tree automata.
and 21 Related for: Alternating finite automaton information
In automata theory, an alternatingfiniteautomaton (AFA) is a nondeterministic finiteautomaton whose transitions are divided into existential and universal...
In automata theory, a finite-state machine is called a deterministic finiteautomaton (DFA), if each of its transitions is uniquely determined by its...
automata theory, an alternating tree automaton (ATA) is an extension of nondeterministic tree automaton as same as alternatingfiniteautomaton extends nondeterministic...
In automata theory, an alternating timed automaton (ATA) is a mix of both timed automaton and alternatingfiniteautomaton. That is, it is a sort of automata...
nested stack automaton allows full access, and also allows stacked values to be entire sub-stacks rather than just single finite symbols. A finite-state machine...
of operations automatically. An automaton with a finite number of states is called a finiteautomaton (FA) or finite-state machine (FSM). The figure on...
automata, finite tree automata (FTA) can be either a deterministic automaton or not. According to how the automaton processes the input tree, finite tree automata...
Air force academy IATA code of San Rafael Airport (Argentina) Alternatingfiniteautomaton, in computer science Anti-Foundation Axiom, a mathematical axiom...
theory, a timed automaton is a finiteautomaton extended with a finite set of real-valued clocks. During a run of a timed automaton, clock values increase...
A reversible cellular automaton is a cellular automaton in which every configuration has a unique predecessor. That is, it is a regular grid of cells...
defined as a (finite or infinite) set of strings that can be described by one of the mathematical formalisms called "finiteautomaton", "regular grammar"...
recursion Finite state automaton Mealy machine Minsky register machine Moore machine State diagram State transition system Deterministic finiteautomaton Nondeterministic...
conservation laws. A block cellular automaton consists of the following components: A regular lattice of cells A finite set of the states that each cell...
recreational mathematics, most notably the invention of the cellular automaton called the Game of Life. Born and raised in Liverpool, Conway spent the...
kinds of finite automata. The classical result in the area is that simulating an n {\displaystyle n} -state nondeterministic finiteautomaton by a deterministic...
construct a nondeterministic finiteautomaton (NFA), which is then made deterministic and the resulting deterministic finiteautomaton (DFA) is run on the target...
can perform to those of a linear bounded automaton if the tape was proportional to the input size, or finite-state machine if it was strictly fixed-length...
science, a signal automaton is a finiteautomaton extended with a finite set of real-valued clocks. During a run of a signal automaton, clock values increase...
After building the automaton, several possibilities exist: the engine may convert it to a deterministic finite-state automaton (DFA) and run the input...
Global Information
