State complexity of Kleene-star operations on regular tree languages

DOI10.14232/ACTACYB.22.2.2015.11MaRDI QIDQ2803055zbMATH OpenOpenAlexFDO

Authors Yo-Sub Han, Sang-Ki Ko, Xiaoxue Piao, Kai Salomaa

Publication date 3 May 2016

Published in Acta Cybernetica (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/835d08b3e3d81a5074209a736e5522ed3e05fa29

zbMATH Keywords

tree automatastate complexityiterated concatenation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• State complexity of Kleene-star operations on trees
• State complexity of the concatenation of regular tree languages
• State complexity of k-parallel tree concatenation
• Universal disjunctive concatenation and star
• State complexity of subtree-free regular tree languages

Cited in

(5)

• State complexity of union and intersection of star on \(k\) regular languages
• State complexity of the concatenation of regular tree languages
• State complexity of Kleene-star operations on trees
• State complexity of subtree-free regular tree languages
• State complexity of k-parallel tree concatenation

This page was built for publication: State complexity of Kleene-star operations on regular tree languages

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