IO and OI. II
From MaRDI portal
Publication:1243578
DOI10.1016/0022-0000(78)90051-XzbMath0371.68020OpenAlexW2078866770MaRDI QIDQ1243578
Joost Engelfriet, Erik Meineche Schmidt
Publication date: 1978
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(78)90051-x
Related Items
Synchronized tree automata ⋮ A connection between concurrency and language theory ⋮ Closure properties of linear context-free tree languages with an application to optimality theory ⋮ Pushdown machines for the macro tree transducer ⋮ Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies ⋮ Equivalences and transformations of regular systems - applications to recursive program schemes and grammars ⋮ Algebraic solutions to recursion schemes ⋮ Parameter-reduction of higher level grammars ⋮ An axiomatic definition of context-free rewriting and its application to NLC graph grammars ⋮ The OI-hierarchy is closed under control ⋮ Deterministic tree pushdown automata and monadic tree rewriting systems ⋮ Unnamed Item ⋮ Generated models and the ω-rule: The nondeterministic case ⋮ Tree transducers, L systems, and two-way machines ⋮ The generative power of delegation networks ⋮ Towards more precise rewriting approximations ⋮ From Tree-Based Generators to Delegation Networks ⋮ DPDA's in 'Atomic normal form' and applications to equivalence problems ⋮ The IO- and OI-hierarchies ⋮ Unnamed Item ⋮ XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles ⋮ Unnamed Item ⋮ Iterated stack automata and complexity classes ⋮ On the expressive power of finitely typed and universally polymorphic recursive procedures ⋮ Basic notions of universal algebra for language theory and graph grammars ⋮ Multiple context-free tree grammars: lexicalization and characterization ⋮ Tree transducers with external functions ⋮ Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations ⋮ Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity ⋮ Basic tree transducers ⋮ Look-ahead on pushdowns ⋮ Linear context-free tree languages and inverse homomorphisms ⋮ A representation of trees by languages. I ⋮ Two Equivalent Regularizations for Tree Adjoining Grammars ⋮ Decidability of the finiteness of ranges of tree transductions ⋮ Principal abstract families of weighted tree languages ⋮ Expressive power of typed and type-free programming languages ⋮ Equational weighted tree transformations ⋮ Approximation properties of abstract data types ⋮ A Mezei-Wright theorem for categorical algebras ⋮ Tree-based picture generation ⋮ All solutions of a system of recursion equations in infinite trees and other contraction theories ⋮ Implementation of data types by algebraic methods ⋮ Fundamental properties of infinite trees ⋮ Hierarchies of hyper-AFLs ⋮ Attributed tree grammars ⋮ Extended macro grammars and stack controlled machines ⋮ Modular tree transducers ⋮ Decidability of EDT0L structural equivalence ⋮ Output string languages of compositions of deterministic macro tree transducers ⋮ Macro tree transducers ⋮ An operational and denotational approach to non-context-freeness
Uses Software
Cites Work
- A generalized approach to formal languages
- Simple program schemes and formal languages
- Generalized sequential machine maps
- A note on infinite trees
- Decidable Properties of Monadic Functional Schemas
- Bottom-up and top-down tree transformations— a comparison
- Data Types as Lattices
- Initial Algebra Semantics and Continuous Algebras
- Inductive methods for proving properties of programs
- Algebraic automata and context-free sets
- Generalized finite automata theory with an application to a decision problem of second-order logic
- An extension of ALGOL-like languages
- Two Families of Languages Related to ALGOL
- Mappings and grammars on trees
- Heterogeneous algebras
- Equational languages
- Tree-Manipulating Systems and Church-Rosser Theorems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: IO and OI. II
