Tree shuffle

DOI10.1016/J.TCS.2013.11.007MaRDI QIDQ389936zbMATH OpenOpenAlexFDO

Authors Sándor Vágvölgyi

Publication date 22 January 2014

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2013.11.007

zbMATH Keywords

shufflehedge mixtree automatonunranked tree

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 1222104 (Why is no real title available?)
• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• scientific article; zbMATH DE number 1462097 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 1916664 (Why is no real title available?)
• Algebraic Theory of Automata and Languages
• Extending regular expressions with iterated shuffle
• Mappings of languages by two-tape devices
• On the uniqueness of shuffle on words and finite languages
• Process Algebra
• Recognizing Shuffled Languages
• SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
• Shuffle and scattered deletion closure of languages
• Shuffle decomposition of regular languages
• Shuffle factorization is unique
• Shuffle languages are in P
• Shuffle on trajectories: Syntactic constraints
• Transformations between different models of unranked bottom-up tree automata

This page was built for publication: Tree shuffle

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