. "In computer science, in particular in formal language theory, a quotient automaton can be obtained from a given nondeterministic finite automaton by joining some of its states. The quotient recognizes a superset of the given automaton; in some cases, handled by the Myhill\u2013Nerode theorem, both languages are equal."@en . . . . . . . "0"^^ . . "952650200"^^ . . . "f"@en . . . . . . "C"@en . "6942"^^ . . . . . . . . . . . "Quotient automaton"@en . . . . . "50558197"^^ . "A"@en . . . . . . . "In computer science, in particular in formal language theory, a quotient automaton can be obtained from a given nondeterministic finite automaton by joining some of its states. The quotient recognizes a superset of the given automaton; in some cases, handled by the Myhill\u2013Nerode theorem, both languages are equal."@en . .