Structural equivalence of context-free grammars

DOI10.1016/S0022-0000(68)80037-6zbMath0179.02301OpenAlexW1983423379MaRDI QIDQ2534284

S. H. Unger, Marvin C. Paull

Publication date: 1968

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(68)80037-6

zbMATH Keywords

languages, automata, networks

Related Items

The strong equivalence of ET0L grammars, A note on top-down deterministic languages, Specific properties of canonical separated grammars, A survey of normal form covers for context-free grammars, Complexity of EOL structural equivalence, Unnamed Item, Decompiling context-free languages from their Polish-like representations, Complexity of E0L structural equivalence, Structural equivalence and ET0L grammars, Unnamed Item, Logic and linguistics meeting, Stanford, 1987, Stack and locally finite transformations on structures with reversible transitions, On the equivalence, containment, and covering problems for the regular and context-free languages, The covering problem for linear context-free grammars, Theory of formal grammars, Decidability of structural equivalence of E0L grammars, Covering-languages of grammars, Decidability of EDT0L structural equivalence

Cites Work

• Unnamed Item
• Bracketed context-free languages
• The Syntax of Programming Languages-A Survey
• Summary of the Issue
• Parenthesis Grammars
• A characterization of parenthesis languages