scientific article
From MaRDI portal
Publication:3086931
zbMath1222.68111MaRDI QIDQ3086931
Thomas Schwentick, Frank Neven, Wim Martens
Publication date: 30 March 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
XMLexpressivenessclosure propertiessurvey articledeterministic top-down tree automatacomplexity of static analysis problems
Related Items (5)
Which XML schemas are streaming bounded repairable? ⋮ A tree-based approach to data flow proofs ⋮ Deciding top-down determinism of regular tree languages ⋮ Deterministic top-down tree automata with Boolean deterministic look-ahead ⋮ Checking in polynomial time whether or not a regular tree language is deterministic top-down
This page was built for publication:
