On shuffling a word with its letter-to-letter substitution

DOI10.3233/FI-2020-1954MaRDI QIDQ4988960zbMATH OpenOpenAlexFDO

Authors Esa Sahla, Vesa Halava, Tero Harju

Publication date 20 May 2021

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2020-1954

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 992018
• Shuffling and unshuffling
• On the expressive power of the shuffle operator matched with intersection by regular sets

Cites work

• Algebraic Theory of Automata and Languages
• Associativity of Infinite Synchronized Shuffles and Team Automata
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• Mappings of languages by two-tape devices
• SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
• Shuffling and unshuffling
• The expressive power of the shuffle product

Cited in

(4)

• A fundamental transformation on the rearrangements of words
• Shuffled languages -- representation and recognition
• Decision problems on copying and shuffling
• The n-ary initial literal and literal shuffle

This page was built for publication: On shuffling a word with its letter-to-letter substitution

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