scientific article; zbMATH DE number 1456950

zbMath0938.68681MaRDI QIDQ4954439

Joost Engelfriet

Publication date: 7 June 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (23)

Alternating tree automata ⋮ Weighted grammars and Kleene's theorem ⋮ Stochastically costed tree automata: Turakainen's theorem ⋮ Logical description of context-free graph languages ⋮ Tree transducers, L systems, and two-way machines ⋮ The IO- and OI-hierarchies ⋮ Formalising and implementing Boost POSIX regular expression matching ⋮ Systolic trees and systolic language recognition by tree automata ⋮ The use of tree transducers to compute translations between graph algebras ⋮ Concatenation of graphs ⋮ Hybrid tree automata and the yield theorem for constituent tree automata ⋮ Automata on infinite objects and their applications to logic and programming ⋮ Bottom-up unranked tree-to-graph transducers for translation into semantic graphs ⋮ Unnamed Item ⋮ Weighted parsing for grammar-based language models over multioperator monoids ⋮ Linear weighted tree automata with storage and inverse linear tree homomorphisms ⋮ Decidability of the finiteness of ranges of tree transductions ⋮ Nondeterministic operations on finite relational structures ⋮ The generating power of total deterministic tree transducers ⋮ Tree-based picture generation ⋮ Modular tree transducers ⋮ The evaluation of first-order substitution is monadic second-order compatible ⋮ Macro tree transducers

This page was built for publication: