Recursive queries and context-free graph grammars
type: Item
instance of: scholarly article
title: Recursive queries and context-free graph grammars
zbMATH Open document ID: 0716.68026
DOI: 10.1016/0304-3975(51)90009-6
published in: Theoretical Computer Science
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P15
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 4180781
zbMATH Keywords: recursive queries
zbMATH Keywords: relational database
zbMATH Keywords: context-free graph grammar
zbMATH Keywords: computation graphs of the query
MaRDI profile type: Publication
full work available at URL: 0304-3975(51)90009-6
OpenAlex ID: W2043199435
cites work: Graph expressions and graph rewritings
cites work: Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: An axiomatic definition of context-free rewriting and its application to NLC graph grammars
cites work: Q3785986
cites work: Q3785987
cites work: Q4385531
cites work: Q3830540
cites work: Translation of logic programs into functional fixpoint equations
cites work: The Semantics of Predicate Logic as a Programming Language
cites work: Fixed point theorems and semantics: A folk tale
cites work: Algebraic automata and context-free sets
cites work: Q3993363
cites work: Recursive query processing: The power of logic
author: Bruno Courcelle
description: scientific article; zbMATH DE number 4180781