Query automata over finite trees
type: Item
instance of: scholarly article
title: Query automata over finite trees
zbMATH Open document ID: 1026.68081
DOI: 10.1016/S0304-3975(01)00301-2
author: Frank Neven
author: Thomas Schwentick
published in: Theoretical Computer Science
publication date: 2002-07-31T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1774113
zbMATH Keywords: query languages
zbMATH Keywords: XML
zbMATH Keywords: tree languages
zbMATH Keywords: logic
zbMATH Keywords: formal languages
MaRDI profile type: Publication
cites work: Q4864249
cites work: A general theory of translation
cites work: Weak Second‐Order Arithmetic and Finite Automata
cites work: Domino-tiling games
cites work: Q4385531
cites work: Tree acceptors and some of their applications
cites work: Q4850061
cites work: Q3857722
cites work: MSO definable string transductions and two-way finite-state transducers
cites work: Complexity results for two-way and multi-pebble automata and their logics
cites work: A Grammar-Based Approach Towards Unifying Hierarchical Data Models
cites work: An Approach to a Unified Theory of Automata
cites work: Q5592246
cites work: Application of model theoretic games to discrete linear orders and finite automata
cites work: Q4473157
cites work: On two-way tree automata
cites work: Q4473158
cites work: Expressiveness of structured document query languages based on attribute grammars
cites work: Définition et etude des Bilangages réguliers
cites work: Q4714446
cites work: Numeration systems, linear recurrences, and regular sets
cites work: Q5541340
cites work: Generalizations of regular sets and their application to a study of context-free languages
cites work: Generalized finite automata theory with an application to a decision problem of second-order logic
cites work: Q4362730
cites work: Q4035346
description: scientific article; zbMATH DE number 1774113