A characterization of parenthesis languages
From MaRDI portal
Publication:5592248
DOI10.1016/S0019-9958(67)90564-5zbMath0196.01703MaRDI QIDQ5592248
Publication date: 1967
Published in: Information and Control (Search for Journal in Brave)
Related Items
On the Balancedness of Tree-to-Word Transducers ⋮ The strong equivalence of ET0L grammars ⋮ Computing minimal interpolation bases ⋮ Origins of the analysis of the Euclidean algorithm ⋮ On some open problems about marcus contextual languages ⋮ Unnamed Item ⋮ Beyond operator-precedence grammars and languages ⋮ Language learning from membership queries and characteristic examples ⋮ Sofic-Dyck shifts ⋮ Unnamed Item ⋮ Balancedness of MSO transductions in polynomial time ⋮ Analysis of Euclidean algorithms for polynomials over finite fields ⋮ Unnamed Item ⋮ Tree correspondence problems ⋮ The word problem for visibly pushdown languages described by grammars ⋮ Multiple context-free tree grammars: lexicalization and characterization ⋮ Operator precedence and the visibly pushdown property ⋮ XML graphs in program analysis ⋮ Analyzing ambiguity of context-free grammars ⋮ 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 ⋮ String Analysis as an Abstract Interpretation ⋮ THE INCLUSION PROBLEM OF CONTEXT-FREE LANGUAGES: SOME TRACTABLE CASES ⋮ Structural equivalence of context-free grammars ⋮ The Inclusion Problem of Context-Free Languages: Some Tractable Cases ⋮ Theory of formal grammars ⋮ Generalized parenthesis languages and minimization of their parenthesis parts ⋮ On the Balancedness of Tree-to-Word Transducers ⋮ Decidability of EDT0L structural equivalence ⋮ Quasi-gcd computations
