scientific article; zbMATH DE number 2080402
From MaRDI portal
Publication:4473157
zbMath1044.68584MaRDI QIDQ4473157
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1949/19490080.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
Branching synchronization grammars with nested tables ⋮ Automata for XML -- a survey ⋮ Frontiers of tractability for typechecking simple XML transformations ⋮ Typechecking for XML transformers ⋮ Look-ahead removal for total deterministic top-down tree transducers ⋮ XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles ⋮ Typechecking top-down XML transformations: Fixed input or output schemas ⋮ GETGRATS ⋮ On the complexity of typechecking top-down XML transformations ⋮ Weighted path queries on semistructured databases ⋮ Attribute grammars for unranked trees as a query language for structured documents ⋮ Deciding equivalence of top-down XML transformations in polynomial time ⋮ Macro forest transducers ⋮ Query automata over finite trees
This page was built for publication:
