Pages that link to "Item:Q5592248"
From MaRDI portal
The following pages link to A characterization of parenthesis languages (Q5592248):
Displaying 24 items.
- The strong equivalence of ET0L grammars (Q287052) (← links)
- XML graphs in program analysis (Q532414) (← links)
- Generalized parenthesis languages and minimization of their parenthesis parts (Q800093) (← links)
- Sofic-Dyck shifts (Q897881) (← links)
- Analysis of Euclidean algorithms for polynomials over finite fields (Q912620) (← links)
- Quasi-gcd computations (Q1071503) (← links)
- Tree correspondence problems (Q1161310) (← links)
- Uniformly erasable AFL (Q1225462) (← links)
- On the equivalence, containment, and covering problems for the regular and context-free languages (Q1229100) (← links)
- The covering problem for linear context-free grammars (Q1232301) (← links)
- Origins of the analysis of the Euclidean algorithm (Q1344935) (← links)
- Decidability of EDT0L structural equivalence (Q1605312) (← links)
- Balancedness of MSO transductions in polynomial time (Q1705700) (← links)
- Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
- Operator precedence and the visibly pushdown property (Q1757840) (← links)
- Theory of formal grammars (Q1846334) (← links)
- Beyond operator-precedence grammars and languages (Q2186819) (← links)
- Analyzing ambiguity of context-free grammars (Q2266946) (← links)
- The word problem for visibly pushdown languages described by grammars (Q2461562) (← links)
- Structural equivalence of context-free grammars (Q2534284) (← links)
- Computing minimal interpolation bases (Q2628323) (← links)
- String Analysis as an Abstract Interpretation (Q3075489) (← links)
- THE INCLUSION PROBLEM OF CONTEXT-FREE LANGUAGES: SOME TRACTABLE CASES (Q3086239) (← links)
- On the Balancedness of Tree-to-Word Transducers (Q6169900) (← links)
