The following pages link to (Q4385528):
Displaying 22 items.
- On regular realizability problems for context-free languages (Q327306) (← links)
- Context-free pairs of groups. I: Context-free pairs and graphs (Q444402) (← links)
- Grammar semantics, analysis and parsing by abstract interpretation (Q655410) (← links)
- Exploiting symmetries in mathematical programming via orbital independence (Q829174) (← links)
- Comparisons of Parikh's condition to other conditions for context-free languages (Q1128989) (← links)
- Infinite hypergraphs. II: Systems of recursive equations (Q1199532) (← links)
- Group presentations, formal languages and characterizations of one- counter groups (Q1210289) (← links)
- Ambiguity in omega context free languages (Q1399989) (← links)
- Complete formal systems for equivalence problems (Q1575907) (← links)
- \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
- Shortest path algorithms for functional environments (Q1751143) (← links)
- Representing recursively enumerable languages by iterated deletion (Q1826643) (← links)
- On the rational subsets of the free group (Q1924996) (← links)
- The failure of the strong pumping lemma for multiple context-free languages (Q2254497) (← links)
- Epsilon-reducible context-free languages and characterizations of indexed languages (Q2280325) (← links)
- Bijective sequential mappings of a free monoid onto another (Q4365013) (← links)
- Church-Rosser codes (Q4608513) (← links)
- On the equivalence of linear conjunctive grammars and trellis automata (Q4825389) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q5055831) (← links)
- (Q5446606) (← links)
- Regular Realizability Problems and Context-Free Languages (Q5500698) (← links)
- Wadge hierarchy of omega context-free languages (Q5958618) (← links)
