Automata construction

In automata theory, automata construction is an important mathematical technique used to demonstrate the existence of an automaton with a certain desired property. Very often, it is presented as an algorithm that takes a desired property as input and produces as output an automaton with the property.

Many hard problems in automata theory involve finding the right construction of an automaton such that the problem can be answered. For example, the famous construction in McNaughton's Theorem answered the question if non-deterministic Büchi automaton can always be translated into a deterministic Muller automaton.

Example

Powerset construction is an algorithm to construct a deterministic finite automaton from a given nondeterministic finite automaton.

Optimality of a construction

An automata construction is called optimal if there is an input to the construction such that there exist no automaton that satisfy the desired property with smaller size complexity than output of the construction.

gollark: Not even that.

gollark: You HAVE TO use external libraries.

gollark: JS has no native bignums.

gollark: JS hasn't got native ones.

gollark: Except if you're manually writing the syscalls and stuff in assembly.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.