Tree shuffle

DOI10.1016/j.tcs.2013.11.007zbMath1358.68177OpenAlexW2912508253MaRDI QIDQ389936

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

• On the uniqueness of shuffle on words and finite languages
• Extending regular expressions with iterated shuffle
• Shuffle on trajectories: Syntactic constraints
• Shuffle and scattered deletion closure of languages
• Shuffle languages are in P
• Shuffle factorization is unique
• Recognizing Shuffled Languages
• SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
• Transformations Between Different Models of Unranked Bottom-Up Tree Automata
• Process Algebra
• Algebraic Theory of Automata and Languages
• Mappings of languages by two-tape devices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item