Quotient automaton
id:
quotient-automaton-234-2704433
title:
Quotient automaton
text:
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–Nerode theorem, both languages are equal.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Quotient_automaton
date created:
date modified:
2020-04-23T10:38:37Z
main entity:
{"identifier":"Q25305409","url":"https://www.wikidata.org/entity/Q25305409"}
image:
fields total:
13
integrity:
13