About: Aperiodic finite state automaton

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

An aperiodic finite-state automaton (also called a counter-free automaton) is a finite-state automaton whose transition monoid is aperiodic.

Property Value
dbo:abstract
  • An aperiodic finite-state automaton (also called a counter-free automaton) is a finite-state automaton whose transition monoid is aperiodic. (en)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 17995149 (xsd:integer)
dbo:wikiPageLength
  • 3439 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1032099919 (xsd:integer)
dbo:wikiPageWikiLink
dbp:date
  • December 2020 (en)
dbp:reason
  • What constraints are placed on x,y,z and n ? (en)
dbp:wikiPageUsesTemplate
dct:subject
gold:hypernym
rdf:type
rdfs:comment
  • An aperiodic finite-state automaton (also called a counter-free automaton) is a finite-state automaton whose transition monoid is aperiodic. (en)
rdfs:label
  • Aperiodic finite state automaton (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of
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