Definitions from Wikipedia (Quotient automaton)

▸ noun:  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.


▸ Words similar to quotient automaton
▸ Usage examples for quotient automaton

▸ Idioms related to quotient automaton
▸ Wikipedia articles (New!)
▸ Words that often appear near quotient automaton
▸ Rhymes of quotient automaton

▸ Invented words related to quotient automaton