State complexity of k-parallel tree concatenation

DOI10.3233/FI-2017-1560MaRDI QIDQ4601129zbMATH OpenOpenAlexFDO

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

Publication date 19 January 2018

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2017-1560

zbMATH Keywords

regular tree languagestree automatastate complexitytree concatenation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• State complexity of the concatenation of regular tree languages
• State complexity of Kleene-star operations on regular tree languages
• State complexity of Kleene-star operations on trees
• scientific article; zbMATH DE number 7315100
• State complexity of subtree-free regular tree languages

Cited in

(4)

• State complexity of the concatenation of regular tree languages
• State complexity of Kleene-star operations on trees
• State complexity of regular tree languages for tree matching
• State complexity of Kleene-star operations on regular tree languages

This page was built for publication: State complexity of \(k\)-parallel tree concatenation

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