Bracketed context-free languages

DOI10.1016/S0022-0000(67)80003-5zbMath0153.00802OpenAlexW2029087760MaRDI QIDQ2525996

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

Related Items (22)

Context-free grammars with cancellation properties ⋮ Testing for grammatical coverings ⋮ The strong equivalence of ET0L grammars ⋮ Input-driven languages are linear conjunctive ⋮ The validation of SGML content models ⋮ Unnamed Item ⋮ Deterministic regular languages ⋮ Sofic-Dyck shifts ⋮ Unnamed Item ⋮ Nest sets and relativized closure properties ⋮ The word problem for visibly pushdown languages described by grammars ⋮ Structural equivalence and ET0L grammars ⋮ One-unambiguous regular languages ⋮ One-unambiguous regular languages ⋮ Uniformly erasable AFL ⋮ Characterizing derivation trees of context-free grammars through a generalization of finite automata theory ⋮ Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata ⋮ Structural equivalence of 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

• Operations Which Preserve Definability in Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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