Implementation and Application of Automata

DOI10.1007/11605157zbMATH Open1172.68517OpenAlexW2544597226MaRDI QIDQ5897679FDOQ5897679

Authors: Markus Lohrey, Sebastian Maneth 

Publication date: 13 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11605157

Recommendations

• The complexity of tree automata and XPath on grammar-compressed trees
• scientific article; zbMATH DE number 7360256
• Automata for Positive Core XPath Queries on Compressed Documents

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cited In (8)

• Title not available (Why is that?)
• Automata for Positive Core XPath Queries on Compressed Documents
• The complexity of tree automata and XPath on grammar-compressed trees
• Title not available (Why is that?)
• Regular matching and inclusion on compressed tree patterns with context variables
• Regular matching and inclusion on compressed tree patterns with constrained context variables
• Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata
• Foundations of Software Science and Computation Structures

Uses Software

• XPath

This page was built for publication: Implementation and Application of Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897679)