State Complexity of Subtree-Free Regular Tree Languages
From MaRDI portal
Publication:2843085
DOI10.1007/978-3-642-39310-5_8zbMath1388.68167MaRDI QIDQ2843085
Yo-Sub Han, Sang-Ki Ko, Hae-Sung Eom
Publication date: 9 August 2013
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-39310-5_8
state complexity; basic operations; deterministic ranked tree automata; subtree-free regular tree language
68Q45: Formal languages and automata