Implementation and Application of Automata
From MaRDI portal
Publication:5897679
DOI10.1007/11605157zbMath1172.68517OpenAlexW2544597226MaRDI QIDQ5897679
Sebastian Maneth, Markus Lohrey
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
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
The complexity of tree automata and XPath on grammar-compressed trees ⋮ Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata
Uses Software
This page was built for publication: Implementation and Application of Automata