State Complexity of Regular Tree Languages for Tree Pattern Matching

DOI10.1007/978-3-319-09704-6_22zbMath1416.68102OpenAlexW2098693344MaRDI QIDQ5496193

Yo-Sub Han, Ha-Rim Lee, Sang-Ki Ko

Publication date: 7 August 2014

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09704-6_22

zbMATH Keywords

regular tree languagestree automatastate complexitytree pattern matching

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

This page was built for publication: State Complexity of Regular Tree Languages for Tree Pattern Matching