IO and OI. I
From MaRDI portal
Publication:1241985
DOI10.1016/S0022-0000(77)80034-2zbMATH Open0366.68053OpenAlexW4212777788MaRDI QIDQ1241985FDOQ1241985
Erik Meineche Schmidt, Joost Engelfriet
Publication date: 1977
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(77)80034-2
Cites Work
- Bottom-up and top-down tree transformations— a comparison
- Initial Algebra Semantics and Continuous Algebras
- Data Types as Lattices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Heterogeneous algebras
- Title not available (Why is that?)
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Two Families of Languages Related to ALGOL
- Decidable Properties of Monadic Functional Schemas
- Generalized sequential machine maps
- Mappings and grammars on trees
- Simple program schemes and formal languages
- Tree-Manipulating Systems and Church-Rosser Theorems
- Algebraic automata and context-free sets
- A generalized approach to formal languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inductive methods for proving properties of programs
- A note on infinite trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An extension of ALGOL-like languages
- Equational languages
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (46)
- Formal computations of non deterministic recursive program schemes
- Pushdown tree automata, algebraic tree systems, and algebraic tree series
- Recognizability of graph and pattern languages
- Decidability of EDT0L structural equivalence
- High level tree transducers and iterated pushdown tree transducers
- Second-order abstract categorial grammars as hyperedge replacement grammars
- From Tree-Based Generators to Delegation Networks
- An operational and denotational approach to non-context-freeness
- Axiomatizing the equational theory of regular tree languages
- Equational tree transformations
- Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
- Multiple context-free tree grammars: lexicalization and characterization
- The equivalence of tree adjoining grammars and monadic linear context-free tree grammars
- Alphabetic tree relations
- Equational Weighted Tree Transformations with Discounting
- Branching synchronization grammars with nested tables
- Minimality in a linear calculus with iteration
- Transducers and the decidability of independence in free monoids
- The formal power of one-visit attribute grammars
- Attributed tree grammars
- Extending regular expressions with homomorphic replacement
- Hierarchies of tree series transformations
- Decidability of the finiteness of ranges of tree transductions
- The generative power of delegation networks
- Title not available (Why is that?)
- Graph expressions and graph rewritings
- Tree-based picture generation
- Equational weighted tree transformations
- Compositions of tree series transformations
- On the Mild Context-Sensitivity of k-Tree Wrapping Grammar
- Weighted automata with storage
- Time and space complexity of inside-out macro languages
- Iterated linear control and iterated one-turn pushdowns
- Decidable subcases of the equivalence problem for recursive program schemes
- Principal abstract families of weighted tree languages
- Closure properties of linear context-free tree languages with an application to optimality theory
- Unique, guarded fixed points in an additive setting: extended abstract
- Title not available (Why is that?)
- Extended linear macro grammars, iteration grammars, and register programs
- R-fuzzy computation
- Generated models and the ω-rule: The nondeterministic case
- Composition closure of linear extended top-down tree transducers
- Title not available (Why is that?)
- Two Equivalent Regularizations for Tree Adjoining Grammars
- Towards more precise rewriting approximations
- Languages with homomorphic replacements
Uses Software
This page was built for publication: IO and OI. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1241985)
