Implementation and Application of Automata
From MaRDI portal
Publication:5897679
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)
Recommendations
Cited in
(8)- scientific article; zbMATH DE number 7360256 (Why is no real title available?)
- Automata for Positive Core XPath Queries on Compressed Documents
- The complexity of tree automata and XPath on grammar-compressed trees
- scientific article; zbMATH DE number 5999538 (Why is no real title available?)
- 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
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)