Pages that link to "Item:Q1239608"
From MaRDI portal
The following pages link to A generalized approach to formal languages (Q1239608):
Displaying 27 items.
- Look-ahead on pushdowns (Q579952) (← links)
- Implementation of data types by algebraic methods (Q792753) (← links)
- The generative power of delegation networks (Q897662) (← links)
- Macro tree transducers (Q1073576) (← links)
- High level tree transducers and iterated pushdown tree transducers (Q1096399) (← links)
- Parameter-reduction of higher level grammars (Q1099634) (← links)
- Varieties of chain-complete algebras (Q1145208) (← links)
- The formal power of one-visit attribute grammars (Q1157968) (← links)
- The IO- and OI-hierarchies (Q1161273) (← links)
- Multidimensional trees (Q1178697) (← links)
- Iterated stack automata and complexity classes (Q1183602) (← links)
- Un théorème de duplication pour les forets algébriques (Q1229588) (← links)
- Un théorème de Chomsky-Schützenberger pour les forets algébriques (Q1240569) (← links)
- IO and OI. I (Q1241985) (← links)
- IO and OI. II (Q1243578) (← links)
- Pumping lemmas for term languages (Q1250713) (← links)
- Decidability of the finiteness of ranges of tree transductions (Q1271464) (← links)
- On two families of forests (Q1323385) (← links)
- An operational and denotational approach to non-context-freeness (Q1870568) (← links)
- Linear context-free tree languages and inverse homomorphisms (Q2280337) (← links)
- Closure properties of linear context-free tree languages with an application to optimality theory (Q2368942) (← links)
- From Tree-Based Generators to Delegation Networks (Q3522858) (← links)
- Restarting Tree Automata and Linear Context-Free Tree Languages (Q3522874) (← links)
- (Q4157924) (← links)
- (Q4172929) (← links)
- Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables (Q4174258) (← links)
- A Model-Theoretic Description of Tree Adjoining Grammars1 1The research presented in this paper was supported by the Deutsche Forschungsgemeinschaft within the Sonderforschungsbereich 441, TP A2. The authors wish to thank Jens Michaelis and Stephan Kepser (Q4923565) (← links)
