Where results make sense

About us   |   Why use us?   |   Reviews   |   PR   |   Contact us

tree automaton   (Site not responding. Last check: 2007-10-25) Definition: A tree automaton is an extension of a finite state machine, but operates on n-ary constructors. Tree automata may be top-down (starting from the root) or bottom-up (starting from the leaves), and deterministic or nondeterministic. See also deterministic finite tree automaton, nondeterministic finite tree automaton, deterministic tree automaton, nondeterministic tree automaton, bottom-up tree automaton, top-down tree automaton. www.nist.gov /dads/HTML/treeautomata.html   (179 words)

Tree automaton -- Facts, Info, and Encyclopedia article   (Site not responding. Last check: 2007-10-25) A tree automaton is a type of (Click link for more info and facts about finite state machine) finite state machine. Tree automata deal with (Click link for more info and facts about tree structures) tree structures, rather than the (A linear sequence of symbols (characters or words or phrases)) strings of more conventional finite state machines. The tree is accepted if the state labeled at the root is accepting state. www.absoluteastronomy.com /encyclopedia/t/tr/tree_automaton.htm   (221 words)

Tree automaton - Wikipedia, the free encyclopedia A tree automaton is a type of finite state machine. Tree automata deal with tree structures, rather than the strings of more conventional finite state machines. The automaton starts on the root of the tree with the initial state. en.wikipedia.org /wiki/Tree_automaton   (216 words)

Game Environment for Command and Control Operations (GECCO) Developer's Manual   (Site not responding. Last check: 2007-10-25) For example, assume that the automaton X is in a state representing a forest, and the automaton Y is in a state representing a rock. If this automaton is in a state that should change by itself in the future, without being influenced by adjacent automatons (for example a burning forest which burns down after two seconds), this automaton should be requeued. The automaton itself is the automaton in the center of the two-dimensional array. www.nada.kth.se /projects/proj01/krigsspel/documentation/devmanual   (7408 words)

Verification Seminar   (Site not responding. Last check: 2007-10-25) For branching properties, the framework is known and the two-way alternating automaton is a tree automaton. Indeed, the fact that a tree automaton can split to copies and simultaneously read all the paths of the tree has a computational price and is irrelevant for linear properties. The input to a path automaton is a tree, but the automaton cannot split to copies and it can read only a single path of the tree. www.wisdom.weizmann.ac.il /~verify/events/2002/nir.html   (310 words)

[No title] The parse tree set of an ECFG is a local tree language. Next, we introduce a less restricted class called ``single-type'' by prohibiting competition of non-terminals within a single content model. Given a grammar and a tree, these algorithms determine whether that tree is generated by the grammar, and also construct interpretations of the tree. There are top-down tree automata and bottom-up tree automata: the former begins with the root node and assigns states to elements after handling superior elements, while the latter begins with leaf nodes and assigns states to elements after handling subordinate elements. www.cobase.cs.ucla.edu /tech-docs/dongwon/mura0619.html   (8321 words)

DTD Transformation by Patterns and Contextual Conditions On the basis of the tree automaton theory, this paper demonstrates DTD transformation. The states of this tree automaton are the states of the string automaton, namely f0 and f1. A match-identifying automaton performs the computation of the original tree automaton as well as the computation of the tree automaton constructed from the pattern and that constructed from the contextual condition. www.geocities.com /ResearchTriangle/Lab/6259/sgmlxml97.html   (3039 words)

Interconnection of Research Topics The solved form of a set constraint is a tree automaton. We use the derived tree automaton as a decision tool for the verification of liveness/safety properties of the executions of the concurrent constraint program. Tree automata are also used as the backend in the Mona theorem prover. www.mpi-sb.mpg.de /~podelski/overview.html   (594 words)

Automaton   (Site not responding. Last check: 2007-10-25) An automaton is defined by an finite alphabet (set of symbols), a finite set of states and a set of rules relative to each element of the alphabet. An exception thrown when trying to use a state of an automaton which is not defined. Adds a state to the automaton's states set, giving the private representation of this state by a number. www.lifl.fr /~debarbie/TATA/doc/automata/Automaton.html   (816 words)

Ceta: A Library for Equational Tree Automata It supports emptiness testing of tree languages definable by a boolean combination of regular tree automaton over an equational theory containing operators that are associative and/or commutative with identity symbols. Ceta is based on propositional tree automata, and offers algorithms and datastructures for representing tree automata, combining tree automata using boolean operations, and testing emptiness. An alpha version is now available which supports combining equational tree automata and testing emptiness of automaton that are associative, commutative, and free. formal.cs.uiuc.edu /ceta   (418 words)

Exercises   (Site not responding. Last check: 2007-10-25) A feature tree is a multitree such that the edges outgoing from the same node are labeled by different features. Show that a -automaton can be identified with a bottom-up tree automaton such that all trees equivalent under OI reach the same states. Show that the class of languages accepted by feature tree automata is closed under boolean operations and that the emptiness of a language accepted by a feature automaton is decidable. www.grappa.univ-lille3.fr /~tommasi/TATAHTML/node73.html   (924 words)

Lehrstuhl für Informatik VII By generalizing a corresponding proof from the theory of ranked tree automata we show that it is decidable whether a given regular language of unranked trees can be recognized by a top-down deterministic automaton. The standard deterministic top-down model is slightly weaker than the model we use, where at each node the automaton can scan the sequence of the labels of its successors before deciding its next move. The main result is that the class of ground tree rewriting graphs of bounded tree width exactly corresponds to the class of pushdown graphs. www-i7.informatik.rwth-aachen.de /d/publications/pub-Loeding-abstracts.html   (1865 words)

Cover Pages: SGML/XML and Forest/Hedge Automata Theory To locate nodes, a pointed hedge representation is first converted to triplets: (1) a deterministic hedge automaton, (2) a finite-index right-invariant equivalence of states, and (3) a string automaton over the equivalence classes. Informally, a hedge is a sequence of trees. Tree automata are proven to be closed under boolean operators; this allows us to design a XML query language in the way similar to the relational algebra, and induce precise schema for any XML query formulated in this language. www.oasis-open.org /cover/hedgeAutomata.html   (4088 words)

Definition of Tree automaton A tree automaton is a type of finite state machine. Tree automata deal with tree structures, rather than the strings of more conventional finite state machines. The tree is accepted if the state labeled at the root is accepting state. www.wordiq.com /definition/Tree_automaton   (292 words)

Theoretische Informatica Club A notion of derivation tree is introduced for ground term rewriting systems, generalizing the one for context-free grammars. The set of derivation trees of a given ground term rewriting system forms a regular tree language, i.e., can be recognized by a bottom-up tree automaton (a special type of ground term rewriting system). Using the theory of regular tree languages (which generalizes, and is part of, formal language theory) new proofs of known results can be given: (1) viewed as tree grammars, ground term rewriting systems generate regular tree languages, and (2) confluence and termination are decidable for ground term rewriting systems. www.liacs.nl /~cstcs/tic/ticvj97.html   (1072 words)

deterministic finite tree automaton   (Site not responding. Last check: 2007-10-25) The tree nodes are marked with the letters of the alphabet of the automaton, and the transition function encodes the next states for each branch of the tree. See also nondeterministic finite tree automaton, deterministic tree automaton. Sandeep Kumar Shukla, "deterministic finite tree automaton", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. www.nist.gov /dads/HTML/determFinitTreeAutom.html   (111 words)

[No title] A prefix tree is minimal for observed token sequences, but it may not be general enough for use in prediction. Intuitively, the representation is a finite-state machine that accepts a tree rather than a sequence, and for this reason it is termed a tree automaton. Tables 1 and 2, tree automatons are generalized by merging states that share similar transitions. www.cs.washington.edu /research/jair/volume1/schlimmer93a-html/schlimmer93-3.html   (2450 words)

Chapter III Definition 3.1.2 A ross tree is a tree structure starting with the set S of all states of an automaton as the only node at level zero. Since there are a finite number of states in an automaton and hence a finite number of ross, the tree will terminate in a finite number of levels, that is, when all the branches have been terminated. Consider first the automaton of Figure 2.3.1 realizing the event R=(01)*, The state table is shown again in Figure 3.1.1a for convenience in constructing the ross tree in Figure 3.1.1b. www.mondenet.com /~bierman/thesis/ch3.html   (1812 words)

Mini Workshop Tree Automata The notion of equivalence between finite string automata is well-known and several algorithms for constructing a minimal string automaton that is equivalent to a given one exist. Representation of a (k,l)-contextual tree language as a finite tree automaton representation has several advantages over the representation as a set of (k,l)-forks. Work in progress about designing an algorithm to convert a (k,l)-contextual tree language represented as a set of (k,l)-forks into the same language represented as a finite tree automaton will be presented. www.cs.kuleuven.ac.be /~stefanr/MWTA.html   (503 words)

nondeterministic tree automaton   (Site not responding. Last check: 2007-10-25) Definition: A nondeterministic finite state machine that accepts infinite trees rather than just strings. The expressive power of such automata varies depending on the acceptance conditions of the trees. Sandeep Kumar Shukla, "nondeterministic tree automaton", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. www.nist.gov /dads/HTML/nondetermTreeAutom.html   (116 words)

[No title]   (Site not responding. Last check: 2007-10-25) It is finite because the number of states it has is fixed; and it is an automaton because the input determines the transition from one state to another. Each node has six components: a value array — which holds the string value of the node (all input seen till that point) a character: state - which represents the value of the input at the node a pointer: lchild — points to a node which is the left child of the current node. If they are equal, the node is not created and inserted in the tree, but the frequency value of the existing node (of equal value) in the tree is incremented. www.cs.ualberta.ca /~mildred/Report690.doc   (3321 words)

Minimal Ascending and Descending Tree Automata The corresponding subclass of recognizable tree languages is characterized by a structural property that we name "homogeneous." Given a descending tree automaton recognizing a homogeneous tree language, it can be left-to-right (l-r) determinized and then minimized. The obtained minimal l-r-deterministic tree automaton is characterized algebraically. We exhibit a formal correspondence between the two evaluation modes on trees (ascending and descending) and the two on words (right-to-left and left-to-right). epubs.siam.org /sam-bin/dbq/article/16407   (161 words)

Bericht 9313 des Instituts für Informatik und Praktische Mathematik   (Site not responding. Last check: 2007-10-25) For regular tree languages, this point-tree algebra is computable from a (minimal) recognizing tree automaton. The class of finite point-tree algebras recognizing frontier testable (also known as reverse definite) tree languages is described by means of equations. The characterization of the class of frontier testable languages in terms of equations is in contrast with other algebraic approaches to the classification of tree languages (the semigroup and the universal-algebraic approach) where such equations are not possible or not known. www.informatik.uni-kiel.de /reports/1993/9313.html   (173 words)

[No title] The idea is to simulate the pushdown system in the full W-tree, where W is a finite set of directions, and to use the expressive power of alternating two-way tree automata to answer these questions. Finally it is necessary to translate the 2-way tree automaton into an equivalent nondeterministic one-way tree automaton. We show that the set of winning plays is a proper Sigma-3-set in the Borel hierarchy, thus transcending the Boolean closure of Sigma-2-sets which arises with the standard automata theoretic winning conditions (such as the Muller, Rabin, or parity condition). www.lsv.ens-cachan.fr /~cachat/Download/cachat.bib   (409 words)

Project-Team-SECSI   (Site not responding. Last check: 2007-10-25) is also able to produce a proof of security, in the form of an alternating tree automaton describing a finite model. utility determinizes alternating tree automata in Prolog notation, outputting deterministic tree automata in XML syntax. Note that word automata are merely particular cases of tree automata. www.inria.fr /rapportsactivite/RA2004/secsi2004/uid24.html   (534 words)

Comp.compilers: Re: need help on tree automata As the name says, they are automata operating on trees instead of state of this tree automaton, the automaton is said to accept Tree automata are not normally defined as modifying trees, compilers.iecc.com /comparch/article/00-03-015   (472 words)

[Coq-Club] POSTDOCTORAL POSITION IN CERTIFIED ANALYSIS OF SOFTWARE   (Site not responding. Last check: 2007-10-25) In this group, we develop the verification tool called Timbuk (http://www.irisa.fr/lande/genet/timbuk) which is based on rewriting, tree automata and approximation techniques. In this setting our tool produces a tree automaton recognizing every possible behavior of a protocol attacked by an intruder. This postdoctoral position is concerned with developing and certifying a program that checks that the produced tree automaton is complete w.r.t. pauillac.inria.fr /pipermail/coq-club/2005/001676.html   (277 words)

DSD - Document Structure Description Both notations rely on the theory of tree automata for unranked trees (those whose nodes may have a varying number of children). Moreover, the root of the tree must be associated with an initial identifier. Moreover, the tree automaton technique prevents the document from being processed in an on-line fashion: the whole document must be read before it can be processed. www.research.att.com /projects/DSD/relax-ng-nwq.html   (1565 words)

Information Extraction from Structured Documents using k-testable Tree Automaton Inference (ResearchIndex)   (Site not responding. Last check: 2007-10-25) Much of the previous work on IE from struc- tured documents, such as HTML or XML, uses learning techniques that are based on strings, such as finite automata induction. This paper explores methods that exploit the tree structure of the documents. In particular, our method infers a k- testable tree automaton from a small set of annotated examples and explores various ways... citeseer.ist.psu.edu /591358.html   (359 words)

Rewriting for Cryptographic Protocol Verification - Genet, Klay (ResearchIndex)   (Site not responding. Last check: 2007-10-25) Protocols are operationally described using Term Rewriting Systems and the initial set of communication requests is described by a tree automaton. Starting from these two representations, we automatically compute an overapproximation of the set of exchanged messages (also recognized by a tree automaton). 20 Deterministic Tree Pushdown Automata and Monadic Tree Rewrit.. citeseer.ist.psu.edu /283440.html   (566 words)

Try your search on: Qwika (all wikis)

About us   |   Why use us?   |   Reviews   |   Press   |   Contact us   Copyright © 2005-2007 www.factbites.com Usage implies agreement with terms.