IO and OI. II
From MaRDI portal
Publication:1243578
Cites work
- scientific article; zbMATH DE number 3653565 (Why is no real title available?)
- scientific article; zbMATH DE number 3473274 (Why is no real title available?)
- scientific article; zbMATH DE number 3478415 (Why is no real title available?)
- scientific article; zbMATH DE number 3499212 (Why is no real title available?)
- scientific article; zbMATH DE number 3501022 (Why is no real title available?)
- scientific article; zbMATH DE number 3513288 (Why is no real title available?)
- scientific article; zbMATH DE number 3540387 (Why is no real title available?)
- scientific article; zbMATH DE number 3550181 (Why is no real title available?)
- scientific article; zbMATH DE number 3558912 (Why is no real title available?)
- scientific article; zbMATH DE number 3558992 (Why is no real title available?)
- scientific article; zbMATH DE number 3576680 (Why is no real title available?)
- scientific article; zbMATH DE number 3438414 (Why is no real title available?)
- scientific article; zbMATH DE number 3438417 (Why is no real title available?)
- scientific article; zbMATH DE number 3439971 (Why is no real title available?)
- scientific article; zbMATH DE number 3227055 (Why is no real title available?)
- scientific article; zbMATH DE number 3322506 (Why is no real title available?)
- A generalized approach to formal languages
- A note on infinite trees
- Algebraic automata and context-free sets
- An extension of ALGOL-like languages
- Bottom-up and top-down tree transformations— a comparison
- Data Types as Lattices
- Decidable Properties of Monadic Functional Schemas
- Equational languages
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Generalized sequential machine maps
- Heterogeneous algebras
- Inductive methods for proving properties of programs
- Initial Algebra Semantics and Continuous Algebras
- Mappings and grammars on trees
- Simple program schemes and formal languages
- Tree-Manipulating Systems and Church-Rosser Theorems
- Two Families of Languages Related to ALGOL
Cited in
(51)- A connection between concurrency and language theory
- Algebraic solutions to recursion schemes
- Parameter-reduction of higher level grammars
- The OI-hierarchy is closed under control
- Decidability of EDT0L structural equivalence
- Macro tree transducers
- An operational and denotational approach to non-context-freeness
- From Tree-Based Generators to Delegation Networks
- Basic notions of universal algebra for language theory and graph grammars
- Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
- Multiple context-free tree grammars: lexicalization and characterization
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- Deterministic tree pushdown automata and monadic tree rewriting systems
- Basic tree transducers
- Look-ahead on pushdowns
- A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
- Generated models and the \(\omega\)-rule: the nondeterministic case
- Term rewriting with prefix context constraints and bottom-up strategies
- Synchronized tree automata
- Extended macro grammars and stack controlled machines
- Fundamental properties of infinite trees
- Pushdown machines for the macro tree transducer
- Attributed tree grammars
- Iterated stack automata and complexity classes
- The IO- and OI-hierarchies
- Tree transducers, L systems, and two-way machines
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Tree transducers with external functions
- Decidability of the finiteness of ranges of tree transductions
- A representation of trees by languages. I
- The generative power of delegation networks
- Tree-based picture generation
- scientific article; zbMATH DE number 7471714 (Why is no real title available?)
- Expressive power of typed and type-free programming languages
- Equational weighted tree transformations
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
- On the expressive power of finitely typed and universally polymorphic recursive procedures
- Output string languages of compositions of deterministic macro tree transducers
- A Mezei-Wright theorem for categorical algebras
- Principal abstract families of weighted tree languages
- Closure properties of linear context-free tree languages with an application to optimality theory
- Hierarchies of hyper-AFLs
- scientific article; zbMATH DE number 7136663 (Why is no real title available?)
- DPDA's in 'Atomic normal form' and applications to equivalence problems
- All solutions of a system of recursion equations in infinite trees and other contraction theories
- Implementation of data types by algebraic methods
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
- Modular tree transducers
- Approximation properties of abstract data types
- Towards more precise rewriting approximations
- Two Equivalent Regularizations for Tree Adjoining Grammars
This page was built for publication: IO and OI. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1243578)
