State Complexity of Subtree-Free Regular Tree Languages

DOI10.1007/978-3-642-39310-5_8zbMATH Open1388.68167OpenAlexW84880479MaRDI QIDQ2843085FDOQ2843085

Sang-Ki Ko, Yo-Sub Han, 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

zbMATH Keywords

state complexitybasic operationsdeterministic ranked tree automatasubtree-free regular tree language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

This page was built for publication: State Complexity of Subtree-Free Regular Tree Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2843085)