Search results

In [[automata theory]], a '''co-Büchi automaton''' is a variant of [[Büchi automaton]]. T ...istic) Co-Büchi automata are strictly weaker than (nondeterministic) Büchi automata. ...

In [[automata theory]], a '''self-verifying finite automaton''' ('''SVFA''') is a special kind of a [[nondeterministic finite automaton]] (NFA) ...

...omata]] to infinite trees or as an extension of [[ω-automata|infinite-word automata]] to infinite trees. ...allows decision problems in logic to be reduced into decision problems for automata. ...

...e representation of the machine at a given time. For example, for a finite automata and a given input, the configuration will be the current state and the numb It is also possible to have finite graphs: on [[Deterministic finite automaton]] with <math>s</math> states, for a given word of size <math>n</m ...

...nsforming from other models of description to non-deterministic B.C3.BCchi automata|here]]. P. Gastin and D. Oddoux, Fast LTL to Büchi automata translation, Thirteenth Conference on Computer Aided Verification (CAV ′01) ...

==Büchi arithmetic and automata== ...means that the set of integers of ''X'' in base ''k'' is accepted by an [[automata theory|automaton]]. Similarly if <math>n>1</math> there exists an automaton ...

{{Short description|Method used in automata theory to represent tree structures using arithmetical sequences}} In automata theory, a '''tree''' is a particular way of representing a [[Tree (graph th ...

...orphism|homomorphism]] to a finite monoid. Recognizable sets are useful in automata theory, [[formal language]]s and [[algebra]]. ...i^{-1}(\phi(S))</math>, and '''recognizable''' if it is recognized by some finite monoid. This means that there exists a subset <math>T</math> of <math>M</m ...

...reset. Timed automata are a sub-class of a type [[hybrid automaton|hybrid automata]]. Timed automata can be used to model and analyse the timing behavior of computer systems, e ...

...union|union]], product and [[Kleene star]]. Rational sets are useful in [[automata theory]], [[formal language]]s and [[algebra]]. ...rational subsets of <math>N</math> is the smallest set that contains every finite set and is closed under ...

...Gilles|last3=Ho|first3=Hsi-Ming|last4=Monmege|first4=Benjamin |title=Timed-Automata-Based Verification of MITL over Signals |journal=24th International Symposi ...double circle represents accepting locations. However, contrary to finite automata, letters occurs in locations and not in transition. This is because letters ...

...y can be regarded as algebraic expressions of a [[formal language]] over a finite [[Alphabet (formal languages)|alphabet]]. Let ''R'' be a [[semiring]] and ''A'' a finite alphabet. ...

{{Short description|Variation of a finite automaton that runs on infinite input}} ...ton]] that runs on infinite, rather than finite, strings as input. Since ω-automata do not stop, they have a variety of acceptance conditions rather than simpl ...

...recognised by a [[local automaton]], a particular kind of [[deterministic finite automaton]].<ref name=Law130>Lawson (2004) p.130</ref> * {{cite book | last=Lawson | first=Mark V. | title=Finite automata | publisher=Chapman and Hall/CRC | year=2004 | isbn=1-58488-255-7 | zbl=108 ...

...n]] consists of a regular system of cells, each containing a symbol from a finite [[Alphabet (computer science)|alphabet]], together with a uniform rule call As a finite set, the alphabet has a [[discrete topology]], and the collection of states ...

...2=Ullman |first2=J. D |authorlink2=Jeffrey Ullman |title=[[Introduction to Automata Theory, Languages, and Computation]] |year=1979 |edition=first |isbn=81-780 ...

...ematical [[Characterization (mathematics)|characterization]] of [[cellular automata]] in terms of their [[symbolic dynamics]]. It is named after [[Morton L. Cu | title = Cellular automata and groups, by Tullio Ceccherini-Silberstein and Michel Coornaert (book rev ...

...or '''probabilistic cellular automata''' ('''PCA''') or '''random cellular automata''' or '''locally interacting [[Markov chain]]s'''<ref>{{citation ...067}}</ref> are an important extension of [[cellular automaton]]. Cellular automata are a discrete-time [[dynamical system]] of interacting entities, whose sta ...

{{Short description|Finite-state machine where edges carry weights}} ...|last3=Otop|first3=Jan|title=Static Analysis |chapter=Quantitative Monitor Automata |date=2016|editor-last=Rival|editor-first=Xavier|chapter-url=https://link.s ...

...) such that each word has at most one accepting path. Each [[deterministic finite automaton]] (DFA) is an UFA, but not vice versa. DFA, UFA, and NFA recogniz ...a mix of the worlds of DFA and of NFA; in some cases, they lead to smaller automata than DFA and quicker algorithms than NFA. ...