State Complexity of Projection and Quotient on Unranked Trees
From MaRDI portal
Publication:3167589
DOI10.1007/978-3-642-31623-4_22zbMath1304.68119MaRDI QIDQ3167589
Publication date: 2 November 2012
Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31623-4_22
projection; operational state complexity; unranked trees; deterministic tree automata; sequential (parallel) bottom-quotient (top-quotient)
68Q45: Formal languages and automata