Tree Automata
Fuzzy $\omega$-Tree Automata
... - tree automata are defined as an accepting device for fuzzy ω - tree ...- tree automata and some closure properties of the ...- tree language is Buchi recognizable if and only ...
6
Equivalences between Ranked and Unranked Weighted Tree Automata via Binarization
... stepwise tree au- tomata (Carme et al., 2004). A stepwise tree au- tomaton is defined like a (ranked) tree automa- ...unranked tree, if it accepts the extension encoding of the tree ...
10
Sensing Tree Automata as a Model of Syntactic Dependencies
... sensing tree automata (STAs) operating over de- pendency tree representations of MG derivations (these dependency trees are distinct from the MG dependency trees of Boston et ...top-down tree ...
15
Complexity of Equivalence and Learning for Multiplicity Tree Automata
... and tree automata (Bailly et ...multiplicity tree automaton that approximates the ...associated tree series approximates the target ...output tree series with respect to the target ...
36
First-order finite satisfiability vs tree automata in safety verification
... Notice that no additional information is needed for FCM method to au- tomatically verify the reader-writer system. That may be contrasted with the verification using tree automata completion approach ...
16
Deciding the Twins Property for Weighted Tree Automata over Extremal Semifields
... The notion that the twins property can be decided by searching for critical vectors in a compressed search space is due to Kirsten (2012). We have generalized his work in two ways: (i) We allow arbitrary extremal ...
10
On Generating and Simplifying Decision Trees Using Tree Automata Models
... Finite tree automata are generalizations of words au- tomata structured in trees and they keep their essen- tial properties: they have good logical and ensembles’ properties, along with effective ...
12
Syntax based Statistical Machine Translation using Tree Automata and Tree Transducers
... In this paper I present a Master’s thesis proposal in syntax-based Statistical Machine Translation. I propose to build discrimina- tive SMT models using both tree-to-string and tree-to-tree ...
5
Efficient Implementation for Deterministic Finite Tree Automata Minimization
... Tree automata constitute a powerful theoretical tool for several real applications such as XML schemata [1], natural languages processing [2], verification techniques, program analysis ...finite tree ...
12
A Better N Best List: Practical Determinization of Weighted Finite Tree Automata
... of tree automata are summarized well in (Gecseg and Steinby, ...Bottom-up tree recognizers are due to (Thatcher and Wright, 1968), (Doner, 1970), and (Magidor and Moran, ...Top-down tree ...
8
Standard and Non-Standard Inferences in the Description Logic FL0 Using Tree Automata
... looping tree automata (LTAs), and use this result to reduce the subsumption problem to the emptiness problem for ...constructed automata are of exponential size and the emptiness problem for LTAs can ...
14
A Note on Fuzzy Tree Automata
... then tree au- tomaton is an important tool in computer science and have many applications in various areas of computer ...i) automata on infinite words and trees are the basis of model-checking for formally ...
5
Efficient techniques for parsing with tree automata
... in tree automata, but every IRTG can be brought into this convenient ...a tree-adjoining grammar (Koller and Kuhlmann, 2012), and an interpretation into an s-graph algebra models a hyperedge ...
10
DAGGER: A Toolkit for Automata on Directed Acyclic Graphs
... Powerful graph rewriting systems have been used for NLP (Bohnet and Wanner, 2010), yet we con- sider a rather simple model: finite dag automata that have been introduced by (Kamimura and Slutzki, 1981; Kamimura ...
5
Detecting Malicious Behaviors of Software through Analysis of API Sequence k grams
... There have been several researches on detecting malicious behaviors of software. Wang et al. [1] presented an approach of virus detection based on analysis of the suspicious behaviors indicated by the sequences of APIs ...
7
Query Induction with Schema-Guided Pruning Strategies
... We start with a comparison to the Web information extraction tools by Raeymaekers et al. (2008) (see also Raeymaekers, 2008) and Carme et al. (2007). The former is based on learning local tree automata for ...
38
Indexing Ordered Trees for (Nonlinear) Tree Pattern Matching by Pushdown Automata
... formal tree languages have been extensively studied and de- veloped since the 1960s and its main models of computation are various kinds of tree automata [14, 6, ...a tree can be obtained by ...
30
MoL 2019 23: Investigations into the Expressiveness of First order Logic and Weak Path Automata on Infinite Trees
... (tree) automata with a Muller acceptance condition [23] and MSO are effectively equivalent on the infinite binary ...a tree is ranked if it has a fixed branching ...the automata theory of MSO ...
79
Representing Constraints with Automata
... respondingly simpler3 The decidability proof works by showing a correspondence between formulas in the language of WS2S and tree automata, developed in such a way that the formula is sat[r] ...
8
Online Full Text
... to tree automata that the class of context-free grammars can be learned in polynomial time using structural membership queries and structural equivalence ...
9