|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 25 occurrences of 22 keywords
|
|
|
Results
Found 48 publication records. Showing 48 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
51 | Mikolaj Bojanczyk, Thomas Colcombet |
Tree-walking automata do not recognize all regular languages. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
|
50 | Frank Neven |
On the Power of Walking for Querying Tree-Structured Data. (PDF / PS) |
PODS |
2002 |
DBLP DOI BibTeX RDF |
|
46 | Balder ten Cate, Luc Segoufin |
XPath, transitive closure logic, and nested tree walking automata. |
PODS |
2008 |
DBLP DOI BibTeX RDF |
tree walking automata, xpath, xml, transitive closure |
44 | Joost Engelfriet |
The time complexity of typechecking tree-walking tree transducers. |
Acta Informatica |
2009 |
DBLP DOI BibTeX RDF |
|
44 | Mikolaj Bojanczyk, Thomas Colcombet |
Tree-Walking Automata Cannot Be Determinized. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
37 | Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz |
Random Generation of Deterministic Tree (Walking) Automata. |
CIAA |
2009 |
DBLP DOI BibTeX RDF |
|
35 | Owen Rambow, Giorgio Satta |
A Rank Hierarchy for Determinsitic Tree-Walking Transducers. |
CAAP |
1994 |
DBLP DOI BibTeX RDF |
|
32 | Mathias Samuelides, Luc Segoufin |
Complexity of Pebble Tree-Walking Automata. |
FCT |
2007 |
DBLP DOI BibTeX RDF |
|
32 | Leonid Bolotnyy, Gabriel Robins |
Randomized Pseudo-random Function Tree Walking Algorithm for Secure Radio-Frequency Identification. |
AutoID |
2005 |
DBLP DOI BibTeX RDF |
|
32 | Kai Salomaa, Sheng Yu 0001, Jinfeng Zan |
Deterministic Caterpillar Expressions. |
CIAA |
2007 |
DBLP DOI BibTeX RDF |
tree walking automata, decidability, regular expressions, determinism |
30 | Frank Neven, Thomas Schwentick |
On the Power of Tree-Walking Automata. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
|
30 | Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin |
Expressive Power of Pebble Automata. |
ICALP (1) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Mikolaj Bojanczyk |
Tree-Walking Automata. |
LATA |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Wonjoon Choi, Byeong-Hee Roh |
Backward Channel Protection Method for RFID Security Schemes Based on Tree-Walking Algorithms. |
ICCSA (4) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Harry M. Sneed, Shihong Huang |
WSDLTest - A Tool for Testing Web Services. |
WSE |
2006 |
DBLP DOI BibTeX RDF |
WSDL interfaces, tree walking, test result validation, Web services, SOA, XML schema, test data generation, test automation |
23 | Ari Juels, John G. Brainard |
Soft blocking: flexible blocker tags on the cheap. |
WPES |
2004 |
DBLP DOI BibTeX RDF |
blocker tags, tree-walking, privacy, RFID tags, ALOHA |
23 | Ari Juels, Ronald L. Rivest, Michael Szydlo |
The blocker tag: selective blocking of RFID tags for consumer privacy. |
CCS |
2003 |
DBLP DOI BibTeX RDF |
tree walking, privacy, RFID tags, barcodes |
23 | Mikolaj Bojanczyk |
1-Bounded TWA Cannot Be Determinized. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Joost Engelfriet, Kazuhiro Inaba, Sebastian Maneth |
Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity. |
Acta Informatica |
2021 |
DBLP DOI BibTeX RDF |
|
19 | Joost Engelfriet, Kazuhiro Inaba, Sebastian Maneth |
Linear Bounded Composition of Tree-Walking Tree Transducers: Linear Size Increase and Complexity. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
19 | Mikolaj Bojanczyk |
It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton. |
Fundam. Informaticae |
2017 |
DBLP DOI BibTeX RDF |
|
19 | Mikolaj Bojanczyk |
It is undecidable if two regular tree languages can be separated by a deterministic tree-walking automaton. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
19 | Kaleb Lee, Colin Boyd, Juan Manuel González Nieto |
Minimizing Information Leakage of Tree-Based RFID Authentication Protocols Using Alternate Tree-Walking. |
ACISP |
2012 |
DBLP DOI BibTeX RDF |
|
19 | Sándor Vágvölgyi |
Top-Down Tree Transducers with Two-Way Tree Walking Look-Ahead. |
Theor. Comput. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
16 | Stephen B. Peckham |
Globally Partitionable Attribute Grammars. |
WAGA |
1990 |
DBLP DOI BibTeX RDF |
|
14 | Martin Kutrib, Uwe Meyer 0003 |
Deterministic Real-Time Tree-Walking-Storage Automata. |
NCMA |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Martin Kutrib, Uwe Meyer 0003 |
Tree-Walking-Storage Automata. |
DLT |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel |
XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles. |
Theor. Comput. Sci. |
2021 |
DBLP DOI BibTeX RDF |
|
14 | Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel |
XML Navigation and Transformation by Tree-Walking Automata and Transducers with Visible and Invisible Pebbles. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
14 | Anya Helene Bagge |
Analysis and transformation with the nuthatch tree-walking library. |
SLE |
2015 |
DBLP DOI BibTeX RDF |
|
14 | Henrik Björklund, Petter Ericson |
A note on the complexity of deterministic tree-walking transducers. |
NCMA |
2013 |
DBLP BibTeX RDF |
|
14 | Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko |
Loops and overloops for Tree-Walking Automata. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
14 | Sebastian Maneth, Sylvia Friese, Helmut Seidl |
Type Checking of Tree Walking Transducers. |
Modern Applications of Automata Theory |
2012 |
DBLP DOI BibTeX RDF |
|
14 | Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko |
Loops and Overloops for Tree Walking Automata. |
CIAA |
2011 |
DBLP DOI BibTeX RDF |
|
14 | Balder ten Cate, Luc Segoufin |
Transitive closure logic, nested tree walking automata, and XPath. |
J. ACM |
2010 |
DBLP DOI BibTeX RDF |
|
14 | Zoltán Fülöp 0001, Lorand Muzamel |
Weighted Tree-Walking Automata. |
Acta Cybern. |
2009 |
DBLP BibTeX RDF |
|
14 | Lorand Muzamel |
Pebble Alternating Tree-Walking Automata and Their Recognizing Power. |
Acta Cybern. |
2008 |
DBLP BibTeX RDF |
|
14 | Wonjoon Choi, Myungchul Yoon, Byeong-Hee Roh |
Backward Channel Protection Based on Randomized Tree-Walking Algorithm and Its Analysis for Securing RFID Tag Information and Privacy. |
IEICE Trans. Commun. |
2008 |
DBLP DOI BibTeX RDF |
|
14 | Mikolaj Bojanczyk, Thomas Colcombet |
Tree-Walking Automata Do Not Recognize All Regular Languages. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
14 | Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel |
XML transformation by tree-walking transducers with invisible pebbles. |
PODS |
2007 |
DBLP DOI BibTeX RDF |
tree transducer, XML, pebble |
14 | Anca Muscholl, Mathias Samuelides, Luc Segoufin |
Complementing deterministic tree-walking automata. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
14 | Mikolaj Bojanczyk, Thomas Colcombet |
Tree-walking automata cannot be determinized. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
14 | Frank Neven, Thomas Schwentick |
On the power of tree-walking automata. |
Inf. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
14 | Joost Engelfriet, Hendrik Jan Hoogeboom |
Tree-Walking Pebble Automata. |
Jewels are Forever |
1999 |
DBLP BibTeX RDF |
|
14 | David J. Weir |
Linear Context-Free Rewriting Systems and Deterministic Tree-Walking Transducers. |
ACL |
1992 |
DBLP BibTeX RDF |
|
14 | Tetsuo Moriya |
Pebble machines and tree walking machines. |
Inf. Sci. |
1982 |
DBLP DOI BibTeX RDF |
|
11 | Frank Neven |
Automata, Logic, and XML. |
CSL |
2002 |
DBLP DOI BibTeX RDF |
|
11 | Frank Neven, Thomas Schwentick |
Automata-and Logic-Based Pattern Languages for Tree-Structured Data. |
Semantics in Databases |
2001 |
DBLP DOI BibTeX RDF |
XML, logic, automata, formal languages, attribute grammars, query evaluation |
Displaying result #1 - #48 of 48 (100 per page; Change: )
|
|