Pages that link to "Item:Q2368942"

The following pages link to Closure properties of linear context-free tree languages with an application to optimality theory (Q2368942):

Displaying 12 items.

• The equivalence of tree adjoining grammars and monadic linear context-free tree grammars (Q438589) (← links)
• The generative power of delegation networks (Q897662) (← links)
• The congruence theory of closure properties of regular tree languages (Q917323) (← links)
• The Boolean closure of linear context-free languages (Q929298) (← links)
• Second-order abstract categorial grammars as hyperedge replacement grammars (Q972434) (← links)
• Optimality theory as a family of cumulative logics (Q1868481) (← links)
• An operational and denotational approach to non-context-freeness (Q1870568) (← links)
• Linear context-free tree languages and inverse homomorphisms (Q2280337) (← links)
• Finite turns and the regular closure of linear context-free languages (Q2384399) (← links)
• Restarting Tree Automata and Linear Context-Free Tree Languages (Q3522874) (← links)
• The Pumping Lemma for Well-Nested Multiple Context-Free Languages (Q3637235) (← links)
• Regular Approximation of Weighted Linear Context-Free Tree Languages (Q4605512) (← links)