The following pages link to Parenthesis Grammars (Q5553283):
Displaying 50 items.
- The strong equivalence of ET0L grammars (Q287052) (← links)
- Structural equivalence and ET0L grammars (Q671426) (← links)
- Toward a theory of input-driven locally parsable languages (Q728273) (← links)
- Generalized parenthesis languages and minimization of their parenthesis parts (Q800093) (← links)
- Remarques sur les langages de parenthèses (Q800094) (← links)
- Decidability of structural equivalence of E0L grammars (Q807023) (← links)
- Model-checking structured context-free languages (Q832277) (← links)
- Sofic-Dyck shifts (Q897881) (← links)
- The equivalence and inclusion problems for NTS languages (Q1083219) (← links)
- NTS languages are deterministic and congruential (Q1083220) (← links)
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
- Tree correspondence problems (Q1161310) (← links)
- Nest sets and relativized closure properties (Q1170892) (← links)
- Defining families of trees with E0L grammars (Q1179185) (← links)
- Efficient learning of context-free grammars from positive structural examples (Q1186808) (← links)
- On the equivalence, containment, and covering problems for the regular and context-free languages (Q1229100) (← links)
- n-reconstructability of context-free grammars (Q1230514) (← links)
- The covering problem for linear context-free grammars (Q1232301) (← links)
- Inference for regular bilanguages (Q1242698) (← links)
- On equivalence and subclass containment problems for deterministic context-free languages (Q1251906) (← links)
- Die Verwandtschaft kontextfreier Grammatiken (Q1258179) (← links)
- A formal specification of document processing (Q1370522) (← links)
- Decidability of EDT0L structural equivalence (Q1605312) (← links)
- Generalizing input-driven languages: theoretical and practical benefits (Q1706605) (← links)
- Operator precedence and the visibly pushdown property (Q1757840) (← links)
- Theory of formal grammars (Q1846334) (← links)
- Weighted operator precedence languages (Q2064530) (← links)
- Beyond operator-precedence grammars and languages (Q2186819) (← links)
- Operator precedence temporal logic and model checking (Q2215961) (← links)
- The word problem for visibly pushdown languages described by grammars (Q2461562) (← links)
- Structural equivalence of context-free grammars (Q2534284) (← links)
- Propositional dynamic logic with recursive programs (Q2643333) (← links)
- Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization (Q2944566) (← links)
- Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages (Q3075534) (← links)
- First-Order Logic Definability of Free Languages (Q3194725) (← links)
- (Q3339311) (← links)
- (Q3384888) (← links)
- Logic and linguistics meeting, Stanford, 1987 (Q3818286) (← links)
- (Q3873564) (← links)
- (Q3899528) (← links)
- (Q3922198) (← links)
- On strict interpretations of grammar forms (Q4199558) (← links)
- Complexity of E0L structural equivalence (Q4359286) (← links)
- (Q5016361) (← links)
- Complexity of EOL structural equivalence (Q5096917) (← links)
- (Q5101344) (← links)
- Weighted Operator Precedence Languages (Q5111245) (← links)
- UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES (Q5462115) (← links)
- The theory of languages (Q5551468) (← links)
- The theory of languages (Q5592247) (← links)
