About: Tree-walking automaton     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FTree-walking_automaton&invfp=IFP_OFF&sas=SAME_AS_OFF

A tree-walking automaton (TWA) is a type of finite automaton that deals with tree structures rather than strings. The concept was originally proposed by Aho and Ullman. The following article deals with tree-walking automata. For a different notion of tree automaton, closely related to regular tree languages, see branching automaton.

AttributesValues
rdfs:label
  • Automate cheminant (fr)
  • Tree-walking automaton (en)
rdfs:comment
  • Un automate cheminant dans les arbres, appelé en abrégé automate cheminant (en anglais tree walking automaton (TWA)) est une variante des automates finis qui opère sur des arbres plutôt que sur des mots. Le concept a déjà été défini par Aho et Ullman en 1971. Le présent article traite des automates cheminant. Les automates d'arbres (ascendants ou descendants) sont une autre catégorie d'automates, et reconnaissent les langages réguliers d'arbres. (fr)
  • A tree-walking automaton (TWA) is a type of finite automaton that deals with tree structures rather than strings. The concept was originally proposed by Aho and Ullman. The following article deals with tree-walking automata. For a different notion of tree automaton, closely related to regular tree languages, see branching automaton. (en)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • Un automate cheminant dans les arbres, appelé en abrégé automate cheminant (en anglais tree walking automaton (TWA)) est une variante des automates finis qui opère sur des arbres plutôt que sur des mots. Le concept a déjà été défini par Aho et Ullman en 1971. Le présent article traite des automates cheminant. Les automates d'arbres (ascendants ou descendants) sont une autre catégorie d'automates, et reconnaissent les langages réguliers d'arbres. (fr)
  • A tree-walking automaton (TWA) is a type of finite automaton that deals with tree structures rather than strings. The concept was originally proposed by Aho and Ullman. The following article deals with tree-walking automata. For a different notion of tree automaton, closely related to regular tree languages, see branching automaton. (en)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software