In theoretical computer science and formal language theory, the complementation of an automaton is the problem of computing an automaton that accepts precisely the words rejected by another automaton. Formally, given an automaton A which recognizes a regular language L, we want to compute an automaton recognizing precisely the words that are not in L, i.e., the complement of L.

Several questions on the complementation operation are studied, such as:

  • Its computational complexity: what is the complexity, given an automaton, of computing an automaton for the complement language?
  • Its state complexity: what is the smallest number of states of an automaton recognizing the complement?

With deterministic finite automata

With nondeterministic finite automata

With a nondeterministic finite automaton, the state complexity of the complement automaton may be exponential.[1] Lower bounds are also known in the case of unambiguous automata.[2]

With two-way automata

Complementation has also been studied for two-way automata.[3]

With Büchi automata

See also

References

  1. ↑ Birget, Jean-Camille (1993). "Partial orders on words, minimal elements of regular languages, and state complexity". Theoretical Computer Science. 119 (2): 267–291. doi:10.1016/0304-3975(93)90160-U. ISSN 0304-3975.
  2. ↑ Göös, Mika; Kiefer, Stefan; Yuan, Weiqiang (12 February 2022). "Lower Bounds for Unambiguous Automata via Communication Complexity". arXiv:2109.09155 [cs.FL].
  3. ↑ Geffert, Viliam; Mereghetti, Carlo; Pighizzini, Giovanni (2007-08-01). "Complementing two-way finite automata". Information and Computation. 205 (8): 1173–1187. doi:10.1016/j.ic.2007.01.008. ISSN 0890-5401.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.