IO and OI. I
From MaRDI portal
Publication:1241985
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
(46)- Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
- The formal power of one-visit attribute grammars
- Axiomatizing the equational theory of regular tree languages
- R-fuzzy computation
- An operational and denotational approach to non-context-freeness
- The equivalence of tree adjoining grammars and monadic linear context-free tree grammars
- Equational tree transformations
- Recognizability of graph and pattern languages
- Equational weighted tree transformations with discounting
- Towards more precise rewriting approximations
- Two Equivalent Regularizations for Tree Adjoining Grammars
- Equational weighted tree transformations
- Tree-based picture generation
- Weighted automata with storage
- Decidable subcases of the equivalence problem for recursive program schemes
- Extended linear macro grammars, iteration grammars, and register programs
- Hierarchies of tree series transformations
- Attributed tree grammars
- Pushdown tree automata, algebraic tree systems, and algebraic tree series
- Formal computations of non deterministic recursive program schemes
- Alphabetic tree relations
- Decidability of the finiteness of ranges of tree transductions
- The generative power of delegation networks
- Generated models and the \(\omega\)-rule: the nondeterministic case
- scientific article; zbMATH DE number 7136663 (Why is no real title available?)
- Multiple context-free tree grammars: lexicalization and characterization
- High level tree transducers and iterated pushdown tree transducers
- Minimality in a linear calculus with iteration
- Second-order abstract categorial grammars as hyperedge replacement grammars
- scientific article; zbMATH DE number 7471714 (Why is no real title available?)
- Time and space complexity of inside-out macro languages
- Extending regular expressions with homomorphic replacement
- Decidability of EDT0L structural equivalence
- Transducers and the decidability of independence in free monoids
- Composition closure of linear extended top-down tree transducers
- Principal abstract families of weighted tree languages
- Graph expressions and graph rewritings
- Closure properties of linear context-free tree languages with an application to optimality theory
- A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
- From Tree-Based Generators to Delegation Networks
- Languages with homomorphic replacements
- Unique, guarded fixed points in an additive setting: extended abstract
- Compositions of tree series transformations
- Branching synchronization grammars with nested tables
- Iterated linear control and iterated one-turn pushdowns
- On the Mild Context-Sensitivity of k-Tree Wrapping Grammar
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)
