Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Tree_automaton> ?p ?o. }
Showing items 1 to 23 of
23
with 100 items per page.
- Tree_automaton abstract "A tree automaton is a type of state machine. Tree automata deal with tree structures, rather than the strings of more conventional state machines.The following article deals with branching tree automata, which correspond to regular languages of trees. For a different notion of tree automaton, see tree walking automaton.As with classical automata, finite tree automata (FTA) can be either a deterministic automaton or not. According to how the automaton processes the input tree, finite tree automata can be of two types: (a) bottom up, (b) top down. This is an important issue, as although non-deterministic (ND) top-down and ND bottom-up tree automata are equivalent in expressive power, deterministic top-down automata are strictly less powerful than their deterministic bottom-up counterparts, because tree properties specified by deterministic top-down tree automata can only depend on path properties. (Deterministic bottom-up tree automata are as powerful as ND tree automata.)".
- Tree_automaton wikiPageExternalLink Tree-Automata.shtml).
- Tree_automaton wikiPageExternalLink ).
- Tree_automaton wikiPageExternalLink tata.gforge.inria.fr.
- Tree_automaton wikiPageExternalLink ).
- Tree_automaton wikiPageExternalLink ).
- Tree_automaton wikiPageExternalLink ).
- Tree_automaton wikiPageID "98748".
- Tree_automaton wikiPageRevisionID "602990844".
- Tree_automaton hasPhotoCollection Tree_automaton.
- Tree_automaton subject Category:Automata_theory.
- Tree_automaton subject Category:Trees_(data_structures).
- Tree_automaton comment "A tree automaton is a type of state machine. Tree automata deal with tree structures, rather than the strings of more conventional state machines.The following article deals with branching tree automata, which correspond to regular languages of trees. For a different notion of tree automaton, see tree walking automaton.As with classical automata, finite tree automata (FTA) can be either a deterministic automaton or not.".
- Tree_automaton label "Automate d'arbres".
- Tree_automaton label "Autómato de árvore".
- Tree_automaton label "Tree automaton".
- Tree_automaton sameAs Automate_d'arbres.
- Tree_automaton sameAs Autómato_de_árvore.
- Tree_automaton sameAs m.0p8rz.
- Tree_automaton sameAs Q2872598.
- Tree_automaton sameAs Q2872598.
- Tree_automaton wasDerivedFrom Tree_automaton?oldid=602990844.
- Tree_automaton isPrimaryTopicOf Tree_automaton.