scientific article

zbMath0981.68082MaRDI QIDQ2778879

Markus Lohrey

Publication date: 21 March 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2051/20510201

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (10)

Grammar-Based Tree Compression ⋮ Inverse monoids: decidability and complexity of algebraic questions. ⋮ The complexity of tree automata and XPath on grammar-compressed trees ⋮ Automata for XML -- a survey ⋮ On Synchronizing Tree Automata and Their Work–Optimal Parallel Run, Usable for Parallel Tree Pattern Matching ⋮ Tree compression using string grammars ⋮ Partially commutative inverse monoids. ⋮ Monadic Second-Order Logic and Transitive Closure Logics over Trees ⋮ Unnamed Item ⋮ Parameterized complexity of basic decision problems for tree automata

This page was built for publication: