Bracketed context-free languages
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3174044 (Why is no real title available?)
- scientific article; zbMATH DE number 7354705 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- scientific article; zbMATH DE number 3332047 (Why is no real title available?)
- Operations Which Preserve Definability in Languages
Cited in
(23)- Context-free ambiguity detection using multi-stack pushdown automata
- Decidability of EDT0L structural equivalence
- Theory of formal grammars
- One-unambiguous regular languages
- The strong equivalence of ET0L grammars
- The word problem for visibly pushdown languages described by grammars
- Bracketed contextual grammars
- Structural equivalence and ET0L grammars
- scientific article; zbMATH DE number 3707792 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 3868648 (Why is no real title available?)
- Deterministic regular languages
- Nest sets and relativized closure properties
- Context-free grammars with cancellation properties
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)
