Comparing the Succinctness of Monadic Query Languages Over Finite Trees

RAIRO - Theoretical Informatics and Applications - France
doi 10.1051/ita:2004017
Full Text
Abstract

Available in full text

Date
Authors
Publisher

EDP Sciences

Related search

Finite Query Languages for Sequence Databases

1995English

Highly Expressive Query Languages for Unordered Data Trees

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2015English

Ordering Constraints Over Feature Trees Expressed in Second-Order Monadic Logic

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2000English

Generic Monadic Constructs for Embedded Languages

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

On Decidability of Monadic Logic of Order Over the Naturals Extended by Monadic Predicates

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2007English

Naturally Embedded Query Languages

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1992English

The Expressive Power of Temporal Relational Query Languages

IEEE Transactions on Knowledge and Data Engineering
Computational TheoryComputer Science ApplicationsInformation SystemsMathematics
1997English

Monadic Datalog and the Expressive Power of Languages for Web Information Extraction

2002English

Definability Problems for Graph Query Languages

2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy