| 词条 | 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. ExamplePowerset construction is an algorithm to construct a deterministic finite automaton from a given nondeterministic finite automaton. Optimality of a constructionAn 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. See also
1 : Automata (computation) |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。