An operational and denotational approach to non-context-freeness
type: Item
instance of: scholarly article
title: An operational and denotational approach to non-context-freeness
zbMATH Open document ID: 1025.68099
DOI: 10.1016/S0304-3975(01)00348-6
author: Hans-Peter Kolb
author: Jens Michaelis
author: Uwe Mönnich
author: Frank Morawietz
published in: Theoretical Computer Science
publication date: 2003-05-14T00:00:00Z
Mathematics Subject Classification ID: 68T50
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 1909911
zbMATH Keywords: tree grammars
zbMATH Keywords: MSO logic
zbMATH Keywords: non-context-free phenomena
MaRDI profile type: Publication
cites work: Q4362731
cites work: Weak Second‐Order Arithmetic and Finite Automata
cites work: Q4385531
cites work: The monadic second-order logic of graphs. VII: Graphs as relational structures
cites work: Tree acceptors and some of their applications
cites work: Decision Problems of Finite Automata Design and Related Arithmetics
cites work: Macro tree transducers, attribute grammars, and MSO definable tree translations.
cites work: Q4502802
cites work: IO and OI. I
cites work: IO and OI. II
cites work: Regular description of context-free graph languages
cites work: Macro tree transducers
cites work: Q3323279
cites work: Q4179852
cites work: Languages that Capture Complexity Classes
cites work: Descriptions of cross-serial dependencies
cites work: A generalized approach to formal languages
cites work: Algebraic automata and context-free sets
cites work: Q4370242
cites work: On the generative power of transformational grammars
cites work: Q4954002
cites work: On multiple context-free grammars
cites work: Q3615444
cites work: Generalized finite automata theory with an application to a decision problem of second-order logic
cites work: Q4385530
cites work: The equivalence of four extensions of context-free grammars
description: scientific article; zbMATH DE number 1909911