An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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.

Property Value
dbo:abstract
  • 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. (en)
dbo:thumbnail
dbo:wikiPageID
  • 50558197 (xsd:integer)
dbo:wikiPageLength
  • 6942 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 952650200 (xsd:integer)
dbo:wikiPageWikiLink
dbp:b
  • 0 (xsd:integer)
  • f (en)
dbp:p
  • A (en)
  • C (en)
dbp:wikiPageUsesTemplate
dct:subject
rdfs:comment
  • 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. (en)
rdfs:label
  • Quotient automaton (en)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License