Bracketed context-free languages

DOI10.1016/S0022-0000(67)80003-5zbMATH Open0153.00802OpenAlexW2029087760MaRDI QIDQ2525996FDOQ2525996

Authors: Seymour Ginsburg, Michael A. Harrison 

Publication date: 1967

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(67)80003-5

zbMATH Keywords

mathematical logic

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Operations Which Preserve Definability in Languages
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (23)

• Decidability of EDT0L structural equivalence
• One-unambiguous regular languages
• Theory of formal grammars
• The strong equivalence of ET0L grammars
• The word problem for visibly pushdown languages described by grammars
• Bracketed contextual grammars
• Title not available (Why is that?)
• Structural equivalence and ET0L grammars
• Decidability of structural equivalence of E0L grammars
• Sofic-Dyck shifts
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• The validation of SGML content models
• One-unambiguous regular languages
• Uniformly erasable AFL
• Testing for grammatical coverings
• Input-driven languages are linear conjunctive
• Covering-languages of grammars
• Structural equivalence of context-free grammars
• Title not available (Why is that?)
• Deterministic regular languages
• Nest sets and relativized closure properties
• Context-free grammars with cancellation properties
• Context-free ambiguity detection using multi-stack pushdown automata

This page was built for publication: Bracketed context-free languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2525996)