Finite-state machines

mathematical model of computation; abstract machine that can be in exactly one of a finite number of states at any given time

formal language that can be expressed using a regular expression

finite-state machine in which the transitions are not necessarily uniquely determined by the state and input

thumb|250px|A trie for keys "A", "to", "tea", "ted", "ten", "i", "in", and "inn". Each complete English word has an arbitrary integer value associated with it.|alt=Depiction of a trie. Single empty circle, representing the root node, points to three children. The arrow to each child is marked by a different letter. The children themselves have similar sets of arrows and child nodes, with nodes that correspond to full words bearing blue integer values. In computer science, a trie (, ), also known as a digital tree or prefix tree, is a specialized search tree data structure used to store and ret

finite-state machine that accepts and rejects strings of symbols and only produces a unique computation (or run) of the automaton for each input string

finite-state machine whose output values are determined both by its current state and the current inputs

finite-state machine whose output values are determined only by its current state

standard UNIX utility

type of pumping lemma

theorem

algorithm relating regular expressions to NFAs

finite-state machine with two tapes (input, output)

automaton which either accepts or rejects infinite inputs

method for converting a nondeterministic finite automaton into a deterministic one

free software alternative to lex

Task of transforming a deterministic finite automaton

computer data structure that represents a finite set of strings

in computer science

quantum analog of probabilistic automata

generalization of the non-deterministic finite automaton

In automata theory, a branch of theoretical computer science, an ω-automaton (or stream automaton) is a variation of a finite automaton that runs on infinite, rather than finite, strings as input. Since ω-automata do not stop, they have a variety of acceptance conditions rather than simply a set of accepting states.

Enthropy coding methods

1969 non-fiction book by G. Spencer-Brown

mathematical conjecture

finite automaton that can re-read its input

Minimal DFA accepting set of all suffixes of particular string