Search results

In [[computer science]] and [[automata theory]], a '''Weak Büchi automaton''' is a formalism which represents a se ...ing infinitely often in the final state set <math>F</math>. For Weak Büchi automata, this condition is equivalent to the existence of a run which ultimately st ...

In [[automata theory]], a '''self-verifying finite automaton''' ('''SVFA''') ...mmunication Complexity, OBDDs, and Finite Automata|journal=Information and Computation|volume=169|issue=2|year=2001|pages=284–296|issn=0890-5401|doi=10.1006/inco. ...

...string (computer science)|strings]]. Higher arities lead to proper [[Tree (automata theory)|trees]]. ...Löding| first7=Sophie| last7=Tison| first8=Marc| last8=Tommasi| title=Tree Automata Techniques and Applications|date=November 2008| chapter=Preliminaries | url ...

...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 ...ion(s) of the machine are special vertices of the configuration graph. The computation accepts if and only if there is a path from an initial vertex to an accepti ...

...a lower-order iterated stack automaton in each cell of their stack. These automata can compute every language in <math>\mathsf{ELEMENTARY}</math>, and cannot | journal = Information and Computation ...

...k2=Jeffrey Ullman |title=[[Introduction to Automata Theory, Languages, and Computation]] |year=1979 |edition=first |isbn=81-7808-347-7 |publisher=[[Addison-Wesley ...

...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. ...

...nsforming from other models of description to non-deterministic B.C3.BCchi automata|here]]. ...lper|P. Wolper]], Reasoning about infinite computations, [[Information and Computation]], 115(1994), 1–37.</ref><ref name=KMMP93> ...

{{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 ...

...it forms a bridge between regular expressions and nondeterministic finite automata: two abstract representations of the same class of [[formal language]]s. ...F/MPRI/MPRI.pdf | author=Jean-Éric Pin | title=Mathematical Foundations of Automata Theory | location=Paris | date=Nov 2016 }}</ref>{{rp|59&mdash;61}} The cons ...

...orphism|homomorphism]] to a finite monoid. Recognizable sets are useful in automata theory, [[formal language]]s and [[algebra]]. ...mbH |location=Berlin/Boston |isbn=978-3-11-041332-8 | chapter = Chapter 7: Automata}} ...

...union|union]], product and [[Kleene star]]. Rational sets are useful in [[automata theory]], [[formal language]]s and [[algebra]]. ...ttp://www.liafa.jussieu.fr/~jep/MPRI/MPRI.html Mathematical Foundations of Automata Theory]</ref> ...

...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 ...

...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 ...

...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 ...

...equivalence | title = Proceedings of the 17th International Colloquium on Automata, Languages and Programming | editor1-first = Michael S. | editor1-last = Pa ...ound in [[Linear temporal logic|linear temporal]]/[[Computation tree logic|computation tree logic (branching time logic)]]([[modal logic]]). So-called ''branching ...

...te-state transducer|word transducer]]s extend [[finite-state automata|word automata]]. As with tree automata, a TOP is said to be '''deterministic''' (abbreviated '''DTOP''') if no two ...

In [[automata theory]], an '''unambiguous finite automaton''' ('''UFA''') is a [[nondeter ...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. ...

| title = Classes of Computable Functions Defined by Bounds on Computation: Preliminary Report | title = Introduction to Automata Theory, Languages, and Computation ...

...tions of various fields of fundamental computer science such as [[automata|automata theory]], [[syntactic semigroup]], [[model theory]] and [[semigroup theory] ...name="Straubing">{{cite book |last1=Straubing |first1=Howard |title=Finite Automata, Formal Logic and Circuit Complexity |date=1994 |publisher=Birkhäser |isbn= ...