|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 223 occurrences of 129 keywords
|
|
|
|
|
Results
Found 548 publication records. Showing 548 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 3 | Rafael C. Carrasco, Jan Daciuk, Mikel L. Forcada |
Incremental Construction of Minimal Tree Automata.  |
Algorithmica  |
2009 |
DBLP DOI BibTeX RDF |
Deterministic tree automata, Incremental construction of minimal tree automata |
| 3 | Sara Cohen, Benny Kimelfeld, Yehoshua Sagiv |
Running tree automata on probabilistic XML.  |
PODS  |
2009 |
DBLP DOI BibTeX RDF |
probabilistic trees, probabilistic xml, xml constraints, xml query evaluation, tree automata, xml schema |
| 3 | Johanna Högberg, Andreas Maletti, Jonathan May |
Backward and Forward Bisimulation Minimisation of Tree Automata.  |
CIAA  |
2007 |
DBLP DOI BibTeX RDF |
natural language processing, bisimulation, minimisation, tree automata |
| 3 | Amaury Habrard, José Oncina |
Learning Multiplicity Tree Automata.  |
ICGI  |
2006 |
DBLP DOI BibTeX RDF |
multiplicity tree automata, recognizable tree series, learning from equivalence and membership queries |
| 3 | Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos |
Monotone AC-Tree Automata.  |
LPAR  |
2005 |
DBLP DOI BibTeX RDF |
equational tree automata, complexity, decidability, closure properties |
| 3 | Amaury Habrard, Marc Bernard, François Jacquenet |
Generalized Stochastic Tree Automata for Multi-relational Data Mining.  |
ICGI  |
2002 |
DBLP DOI BibTeX RDF |
Stochastic tree automata, generalization, sorts, multi-relational data mining |
| 3 | Rafael C. Carrasco, Mikel L. Forcada |
Simple Strategies to Encode Tree Automata in Sigmoid Recursive Neural Networks.  |
IEEE Trans. Knowl. Data Eng.  |
2001 |
DBLP DOI BibTeX RDF |
analog neural networks, Tree automata, neural computation, recursive neural networks |
| 3 | Hitoshi Ohsaki |
Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories.  |
CSL  |
2001 |
DBLP DOI BibTeX RDF |
decidability, Tree automata, equational theory |
| 3 | Boris Chidlovskii |
Using Regular Tree Automata as XML Schemas.  |
ADL  |
2000 |
DBLP DOI BibTeX RDF |
XML schema, tree automata, DTD, query algebra |
| 3 | Damián López, Ignacio Piñaga |
Syntactic Pattern Recognition by Error Correcting Analysis on Tree Automata.  |
SSPR/SPR ![In: Advances in Pattern Recognition, Joint IAPR International Workshops SSPR 2000 and SPR 2000, [8th International Workshop on Structural and Syntactic Pattern Recognition, 3rd International Workshop on Statistical Techniques in Pattern Recognition], Alicante, Spain, August 30 - September 1, 2000, Proceedings, pp. 133-142, 2000, Springer, 3-540-67946-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
error correcting parsing, editing distance, tree automata, syntactic pattern recognition |
| 3 | Yuichi Kaji, Toru Fujiwara, Tadao Kasami |
Solving a Unification Problem under Constrained Substitutions Using Tree Automata.  |
FSTTCS  |
1994 |
DBLP DOI BibTeX RDF |
unification problems, constrained substitutions, tree automata, term rewriting systems |
| 3 | Detlef Seese |
Interpretability and tree automata: A simple way to solve algorithmic problems on graphs closely related to trees.  |
Tree Automata and Languages  |
1992 |
DBLP BibTeX RDF |
|
| 3 | Andreas Podelski |
A monoid approach to tree automata.  |
Tree Automata and Languages  |
1992 |
DBLP BibTeX RDF |
|
| 3 | Bruno Bogaert, Sophie Tison |
Equality and Disequality Constraints on Direct Subterms in Tree Automata.  |
STACS  |
1992 |
DBLP DOI BibTeX RDF |
Tree Automata, non linearity |
| 2 | Luis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher |
The Emptiness Problem for Tree Automata with Global Constraints.  |
LICS  |
2010 |
DBLP DOI BibTeX RDF |
Symbolic Constraint Solving, Tree Automata, Monadic Second Order Logic, XML Processing |
| 2 | Zoltán Fülöp, Andreas Maletti, Heiko Vogler |
A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids.  |
Theory Comput. Syst.  |
2009 |
DBLP DOI BibTeX RDF |
Recognizable tree series, Rational tree series, Multioperator monoids, Semirings |
| 2 | Friedrich Otto, Heiko Stamer |
Single-Path Restarting Tree Automata.  |
CAI  |
2009 |
DBLP DOI BibTeX RDF |
restarting tree automaton, single-path top-down tree automaton, classes of tree languages, linear context-free tree language |
| 2 | Andreas Maletti |
A Backward and a Forward Simulation for Weighted Tree Automata.  |
CAI  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Jacques Duparc, Alessandro Facchini, Filip Murlak |
Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata.  |
CSL  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Loek G. Cleophas, Kees Hemerik |
Forest FIRE: A Taxonomy-based Toolkit of Tree Automata and Regular Tree Algorithms.  |
CIAA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Helmut Seidl |
Program Analysis through Finite Tree Automata.  |
CIAA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Akio Fujiyoshi |
Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata.  |
CIAA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Colin Stirling |
Dependency Tree Automata.  |
FOSSACS  |
2009 |
DBLP DOI BibTeX RDF |
binding terms, Tree automata, typed lambda calculus |
| 2 | Rajeev Alur, P. Madhusudan |
Adding nesting structure to words.  |
J. ACM  |
2009 |
DBLP DOI BibTeX RDF |
software model checking, tree automata, Pushdown automata, XML processing |
| 2 | Benoît Boyer, Thomas Genet, Thomas P. Jensen |
Certifying a Tree Automata Completion Checker.  |
IJCAR  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Andreas Maletti |
Minimizing Deterministic Weighted Tree Automata.  |
LATA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren |
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs.  |
LATA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar |
Computing Simulations over Tree Automata.  |
TACAS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Emilie Balland, Yohan Boichut, Thomas Genet, Pierre-Etienne Moreau |
Towards an Efficient Implementation of Tree Automata Completion.  |
AMAST  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Dietrich Kuske, Ingmar Meinecke |
Construction of Tree Automata from Regular Expressions.  |
Developments in Language Theory  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Joe Hendrix, Hitoshi Ohsaki |
Combining Equational Tree Automata over AC and ACI Theories.  |
RTA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Naoki Kobayashi, Hitoshi Ohsaki |
Tree Automata for Non-linear Arithmetic.  |
RTA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Nicolas Peltier |
A Unified View of Tree Automata and Term Schematisations.  |
IFIP TCS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Chenguang Luo |
From Word Automata to Tree Automata.  |
ICYCS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | José M. Sempere |
Translating Multiset Tree Automata into P Systems.  |
Workshop on Membrane Computing  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Ahmed Bouajjani, Peter Habermehl, Lukás Holík, Tayssir Touili, Tomás Vojnar |
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata.  |
CIAA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar |
Composed Bisimulation for Tree Automata.  |
CIAA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Heiko Stamer, Friedrich Otto |
Restarting Tree Automata and Linear Context-Free Tree Languages.  |
CAI  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Zoltán Ésik, Szabolcs Iván |
Aperiodicity in Tree Automata.  |
CAI  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Karianto Wong, Christof Löding |
Unranked Tree Automata with Sibling Equalities and Disequalities.  |
ICALP  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Haitao Ma, Zhongxiao Hao, Yinghui Zhou |
Active XML Schema Containment Checking Based on Tree Automata Theory.  |
CIT  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Johanna Högberg, Andreas Maletti, Jonathan May |
Bisimulation Minimisation for Weighted Tree Automata.  |
Developments in Language Theory  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Heiko Stamer, Friedrich Otto |
Restarting Tree Automata.  |
SOFSEM  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | José M. Sempere, Damián López |
Characterizing Membrane Structures Through Multiset Tree Automata.  |
Workshop on Membrane Computing  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Rafael C. Carrasco, Jan Daciuk, Mikel L. Forcada |
An Implementation of Deterministic Tree Automata Minimization.  |
CIAA  |
2007 |
DBLP DOI BibTeX RDF |
sminimal deterministic tree automata, minimization of automata |
| 2 | Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin |
Tree Automata with Memory, Visibility and Structural Constraints.  |
FoSSaCS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Rajeev Alur |
Marrying words and trees.  |
PODS  |
2007 |
DBLP DOI BibTeX RDF |
nested words, XML, query languages, tree automata, pushdown automata |
| 2 | Michael Benedikt, Leonid Libkin, Frank Neven |
Logical definability and query languages over ranked and unranked trees.  |
ACM Trans. Comput. Log.  |
2007 |
DBLP DOI BibTeX RDF |
Ranked trees, unranked trees, query languages, tree automata, model theory |
| 2 | Lihua Duan, Jessica Chen |
A Formal Approach to Website Maintenance.  |
HASE  |
2007 |
DBLP DOI BibTeX RDF |
reverse engineering, formal verification, labelled transition systems, tree automata |
| 2 | Hitoshi Ohsaki, Hiroyuki Seki |
Languages Modulo Normalization.  |
FroCos  |
2007 |
DBLP DOI BibTeX RDF |
tree automata modulo axioms, equational rewriting, Boolean closedness, hedge automata and XML schema, regularity, decidability |
| 2 | Julien Carme, Rémi Gilleron, Aurélien Lemay, Joachim Niehren |
Interactive learning of node selecting tree transducer.  |
Machine Learning  |
2007 |
DBLP DOI BibTeX RDF |
Monadic queries, Tree automata, Grammatical inference, Wrapper induction, Web information extraction |
| 2 | Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron |
Tree Automata with Equality Constraints Modulo Equational Theories.  |
IJCAR  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Joe Hendrix, Hitoshi Ohsaki, Mahesh Viswanathan |
Propositional Tree Automata.  |
RTA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Jonathan May, Kevin Knight |
Tiburon: A Weighted Tree Automata Toolkit.  |
CIAA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Parosh Aziz Abdulla, Lisa Kaati, Johanna Högberg |
Bisimulation Minimization of Tree Automata.  |
CIAA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Rajeev Alur, Swarat Chaudhuri |
Branching Pushdown Tree Automata.  |
FSTTCS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Thierry Cachat |
Tree Automata Make Ordinal Theory Easy.  |
FSTTCS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Shinya Kawanaka, Haruo Hosoya |
biXid: a bidirectional transformation language for XML.  |
ICFP  |
2006 |
DBLP DOI BibTeX RDF |
XML, tree automata |
| 2 | Manfred Droste, Christian Pech, Heiko Vogler |
A Kleene Theorem for Weighted Tree Automata.  |
Theory Comput. Syst.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Mikhail Sheremet, Dmitry Tishkovsky, Frank Wolter, Michael Zakharyaschev |
Comparative Similarity, Tree Automata, and Diophantine Equations.  |
LPAR  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Isao Yagi, Yoshiaki Takata, Hiroyuki Seki |
A Static Analysis Using Tree Automata for XML Access Control.  |
ATVA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Julien Bernet, David Janin |
Tree Automata and Discrete Distributed Games.  |
FCT  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison |
N-Ary Queries by Tree Automata.  |
DBPL  |
2005 |
DBLP DOI BibTeX RDF |
XML, databases, information extraction, pattern, logic, types, automata |
| 2 | Wim Martens, Joachim Niehren |
Minimizing Tree Automata for Unranked Trees.  |
DBPL  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Markus Lohrey, Sebastian Maneth |
Tree Automata and XPath on Compressed Trees.  |
CIAA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Tadahiro Suda, Haruo Hosoya |
Non-backtracking Top-Down Algorithm for Checking Tree Automata Containment.  |
CIAA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Filip Murlak |
On Deciding Topological Classes of Deterministic Tree Languages.  |
CSL  |
2005 |
DBLP DOI BibTeX RDF |
deterministic tree automata, index hierarchy, Borel hierarchy |
| 2 | Michael Benedikt, Luc Segoufin |
Regular Tree Languages Definable in FO.  |
STACS  |
2005 |
DBLP DOI BibTeX RDF |
Logic, Tree automata |
| 2 | Salvatore La Torre, Aniello Murano |
Reasoning About Co-Büchi Tree Automata.  |
ICTAC  |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | Andreas Maletti |
Relating Tree Series Transducers and Weighted Tree Automata.  |
Developments in Language Theory  |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | Julien Carme, Joachim Niehren, Marc Tommasi |
Querying Unranked Trees with Stepwise Tree Automata.  |
RTA  |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | Philippe de Groote, Bruno Guillaume, Sylvain Salvati |
Vector Addition Tree Automata.  |
LICS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | Kumar Neeraj Verma |
Alternation in Equational Tree Automata Modulo XOR.  |
FSTTCS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | Silvano Dal-Zilio, Denis Lugiez, Charles Meyssonnier |
A logic you can count on.  |
POPL  |
2004 |
DBLP DOI BibTeX RDF |
semi-structured data, tree automata, substructural logic, Presburger arithmetic, ambient |
| 2 | Julien Carme, Aurélien Lemay, Joachim Niehren |
Learning Node Selecting Tree Transducer from Completely Annotated Examples.  |
ICGI  |
2004 |
DBLP DOI BibTeX RDF |
tree automata and logics, grammatical inference, Web information extraction |
| 2 | Olivier Ly |
Compositional Verification: Decidability Issues Using Graph Substitutions.  |
MFCS  |
2004 |
DBLP DOI BibTeX RDF |
Tree Automata, Compositional Verification, Monadic Second-Order Logic |
| 2 | Kumar Neeraj Verma |
On Closure under Complementation of Equational Tree Automata for Theories Extending AC.  |
LPAR  |
2003 |
DBLP DOI BibTeX RDF |
|
| 2 | Christian Pech |
Kleene's Theorem for Weighted Tree-Automata.  |
FCT  |
2003 |
DBLP DOI BibTeX RDF |
Kleenes theorem, Schützenbergers theorem, rational expression, tree, language, automata, weight |
| 2 | Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi |
Residual Finite Tree Automata.  |
Developments in Language Theory  |
2003 |
DBLP DOI BibTeX RDF |
|
| 2 | Ferenc Gécseg |
Comments on Complete Sets of Tree Automata.  |
Developments in Language Theory  |
2003 |
DBLP DOI BibTeX RDF |
|
| 2 | Kumar Neeraj Verma |
Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties.  |
RTA  |
2003 |
DBLP DOI BibTeX RDF |
|
| 2 | José M. Sempere, Damián López |
Learning Decision Trees and Tree Automata for a~Syntactic Pattern Recognition Task.  |
IbPRIA  |
2003 |
DBLP DOI BibTeX RDF |
|
| 2 | Haruo Hosoya, Benjamin C. Pierce |
XDuce: A statically typed XML processing language.  |
ACM Trans. Internet Techn.  |
2003 |
DBLP DOI BibTeX RDF |
XML, Type systems, subtyping, tree automata |
| 2 | Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch |
ACID-Unification Is NEXPTIME-Decidable.  |
MFCS  |
2003 |
DBLP DOI BibTeX RDF |
E-Unification, Dag automata, Complexity, Tree automata, Set constraints |
| 2 | Raymond Kosala, Jan Van den Bussche, Maurice Bruynooghe, Hendrik Blockeel |
Information Extraction in Structured Documents Using Tree Automata Induction.  |
PKDD  |
2002 |
DBLP DOI BibTeX RDF |
|
| 2 | John P. Gallagher, Germán Puebla |
Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs.  |
PADL  |
2002 |
DBLP DOI BibTeX RDF |
|
| 2 | Salvatore La Torre, Aniello Murano, Margherita Napoli |
Weak Muller Acceptance Conditions for Tree Automata.  |
VMCAI  |
2002 |
DBLP DOI BibTeX RDF |
|
| 2 | Joachim Niehren, Mateu Villaret |
Parallelism and Tree Regular Constraints.  |
LPAR  |
2002 |
DBLP DOI BibTeX RDF |
unification, tree automata, computational logic |
| 2 | Aart Middeldorp |
Approximating Dependency Graphs Using Tree Automata Techniques.  |
IJCAR  |
2001 |
DBLP DOI BibTeX RDF |
|
| 2 | Hubert Comon, Véronique Cortier, John Mitchell |
Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols.  |
ICALP  |
2001 |
DBLP DOI BibTeX RDF |
|
| 2 | Thierry Cachat |
Two-Way Tree Automata Solving Pushdown Games.  |
Automata, Logics, and Infinite Games ![In: Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001], pp. 303-317, 2001, Springer, 3-540-00388-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
| 2 | Frank Nießner |
Nondeterministic Tree Automata.  |
Automata, Logics, and Infinite Games ![In: Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001], pp. 135-152, 2001, Springer, 3-540-00388-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
| 2 | Xavier Rival, Jean Goubault-Larrecq |
Experiments with Finite Tree Automata in Coq.  |
TPHOLs  |
2001 |
DBLP DOI BibTeX RDF |
|
| 2 | Felix Klaedtke |
Decision Procedure for an Extension of WS1S.  |
CSL  |
2001 |
DBLP DOI BibTeX RDF |
word languages, weak monadic second-order logic of one successor, WS1S, tree automata |
| 2 | Sophie Tison |
Tree Automata and Term Rewrite Systems.  |
RTA  |
2000 |
DBLP DOI BibTeX RDF |
|
| 2 | Mikel L. Forcada, Rafael C. Carrasco |
Encoding Nondeterministic Finite-State Tree Automata in Sigmoid Recursive Neural Networks.  |
SSPR/SPR ![In: Advances in Pattern Recognition, Joint IAPR International Workshops SSPR 2000 and SPR 2000, [8th International Workshop on Structural and Syntactic Pattern Recognition, 3rd International Workshop on Statistical Techniques in Pattern Recognition], Alicante, Spain, August 30 - September 1, 2000, Proceedings, pp. 203-210, 2000, Springer, 3-540-67946-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
| 2 | Anne Brüggemann-Klein, Derick Wood |
Regularly Extended Two-Way Nondeterministic Tree Automata.  |
CIAA  |
2000 |
DBLP DOI BibTeX RDF |
|
| 2 | Ralf Treinen |
Predicate Logic and Tree Automata with Tests.  |
FoSSaCS  |
2000 |
DBLP DOI BibTeX RDF |
|
| 2 | Paliath Narendran, Michaël Rusinowitch |
The Theory of Total Unary RPO Is Decidable.  |
Computational Logic  |
2000 |
DBLP DOI BibTeX RDF |
recursive path ordering, ground reducibility, ordered rewriting, tree automata, first-order theory |
| 2 | Witold Charatonik |
Directional Type Checking for Logic Programs: Beyond Discriminative Types.  |
ESOP  |
2000 |
DBLP DOI BibTeX RDF |
types in logic programming, directional types, tree automata, regular types |
Displaying result #1 - #100 of 548 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ >>] |
|