A generalized approach to formal languages
From MaRDI portal
Publication:1239608
DOI10.1016/S0022-0000(74)80031-0zbMath0361.68113OpenAlexW2077359248WikidataQ30049317 ScholiaQ30049317MaRDI QIDQ1239608
Publication date: 1974
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(74)80031-0
Related Items
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 for helpful comments., Closure properties of linear context-free tree languages with an application to optimality theory, High level tree transducers and iterated pushdown tree transducers, Parameter-reduction of higher level grammars, Unnamed Item, Unnamed Item, The generative power of delegation networks, Varieties of chain-complete algebras, The formal power of one-visit attribute grammars, From Tree-Based Generators to Delegation Networks, Restarting Tree Automata and Linear Context-Free Tree Languages, The IO- and OI-hierarchies, Multidimensional trees, Iterated stack automata and complexity classes, Un théorème de duplication pour les forets algébriques, Look-ahead on pushdowns, Linear context-free tree languages and inverse homomorphisms, Un théorème de Chomsky-Schützenberger pour les forets algébriques, IO and OI. I, IO and OI. II, Pumping lemmas for term languages, Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables, Decidability of the finiteness of ranges of tree transductions, Implementation of data types by algebraic methods, Macro tree transducers, On two families of forests, An operational and denotational approach to non-context-freeness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized sequential machine maps
- Tree acceptors and some of their applications
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Tree generating regular systems
- Automata in general algebras
- Nested Stack Automata
- Some Word-Problems
- Mappings and grammars on trees
- Heterogeneous algebras
- Algebras with a Scheme of Operators
