scientific article
From MaRDI portal
Publication:3058276
zbMath1235.68004MaRDI QIDQ3058276
Publication date: 19 November 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
XMLpattern matchingtree automatatop-down tree transducerstop-down algorithmsbottom-up algorithmsXML Schema
Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Database theory (68P15) Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05)
Related Items (4)
The emptiness problem for tree automata with at least one global disequality constraint is NP-hard ⋮ Interactive and automated proofs for graph transformations ⋮ Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity ⋮ Classes of Tree Homomorphisms with Decidable Preservation of Regularity
Uses Software
This page was built for publication:
