A characterization of parenthesis languages

Cited in

(31)

Quasi-gcd computations
Tree correspondence problems
Uniformly erasable AFL
On the equivalence, containment, and covering problems for the regular and context-free languages
The covering problem for linear context-free grammars
Origins of the analysis of the Euclidean algorithm
Decidability of EDT0L structural equivalence
Balancedness of MSO transductions in polynomial time
Multiple context-free tree grammars: lexicalization and characterization
Operator precedence and the visibly pushdown property
Theory of formal grammars
Beyond operator-precedence grammars and languages
Analyzing ambiguity of context-free grammars
The word problem for visibly pushdown languages described by grammars
Structural equivalence of context-free grammars
Computing minimal interpolation bases
The strong equivalence of ET0L grammars
String analysis as an abstract interpretation
The inclusion problem of context-free languages: some tractable cases
The Inclusion Problem of Context-Free Languages: Some Tractable Cases
On some open problems about marcus contextual languages
scientific article; zbMATH DE number 3677223 (Why is no real title available?)
scientific article; zbMATH DE number 3707792 (Why is no real title available?)
Higher-order operator precedence languages
On the balancedness of tree-to-word transducers
XML graphs in program analysis
Language learning from membership queries and characteristic examples
On the Balancedness of Tree-to-Word Transducers
Generalized parenthesis languages and minimization of their parenthesis parts
Sofic-Dyck shifts
Analysis of Euclidean algorithms for polynomials over finite fields

This page was built for publication: A characterization of parenthesis languages

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