Structural equivalence and ET0L grammars
type: Item
instance of: scholarly article
title: Structural equivalence and ET0L grammars
zbMATH Open document ID: 0871.68119
DOI: 10.1016/0304-3975(95)00187-5
author: Kai Salomaa
author: D. Wood
author: Sheng Yu
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 983293
zbMATH Keywords: structural equivalence
MaRDI profile type: Publication
full work available at URL: 0304-3975(95)00187-5
OpenAlex ID: W2005657640
cites work: Bracketed context-free languages
cites work: Complexity of some problems concerningL systems
cites work: Parenthesis Grammars
cites work: Q4036763
cites work: Defining families of trees with E0L grammars
cites work: Q4036764
cites work: Structural equivalence of context-free grammars
cites work: One-sided and two-sided context in formal grammars
cites work: Q4140407
cites work: Q5678435
cites work: Complexity of E0L structural equivalence
cites work: Decidability of structural equivalence of E0L grammars
cites work: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
cites work: Q4692941
cites work: Computer science today. Recent trends and developments
description: scientific article; zbMATH DE number 983293