Tree shuffle
From MaRDI portal
Publication:389936
DOI10.1016/J.TCS.2013.11.007zbMATH Open1358.68177OpenAlexW2912508253MaRDI QIDQ389936FDOQ389936
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Process Algebra
- Shuffle on trajectories: Syntactic constraints
- Shuffle languages are in P
- Title not available (Why is that?)
- Mappings of languages by two-tape devices
- Extending regular expressions with iterated shuffle
- Shuffle and scattered deletion closure of languages
- Shuffle factorization is unique
- Recognizing Shuffled Languages
- SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
- Transformations between different models of unranked bottom-up tree automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraic Theory of Automata and Languages
- Shuffle decomposition of regular languages
- On the uniqueness of shuffle on words and finite languages
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)
