SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES-Reference-Cited by-同舟云学术

SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES

Published:2002-12 Issue:06 Volume:13 Page:799-816
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

CÂMPEANU C.¹,SALOMAA K.²,VÁGVÖLGYI S.³

Affiliation:

1. Department of Mathematics and Computer Science, University of Prince Edward Island, Charlottetown, P.E.I. C1A 4P3, Canada

2. Department of Computing and Information Science, Queen's University, Kingston, Ontario, K7L 3N6, Canada

3. Department of Applied Informatics, University of Szeged, Szeged Árpád tér 2, H-6720, Hungary

Abstract

We study the shuffle quotient operation and introduce equivalence relations it defines with respect to a (regular) language. Corresponding to an arbitrary shuffle decomposition we construct a normalized decomposition that is defined in terms of maximal languages. Using closure properties of the normalized decompositions we show that for certain subclasses of regular languages we can effectively decide whether or not the language has a non-trivial shuffle decomposition. We show that shuffle decomposition is undecidable for context-free languages.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054102001461

Reference14 articles.

1. Shuffle factorization is unique

2. Families of locally testable languages

3. Shuffle and scattered deletion closure of languages

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Shuffling a Word with its Letter-to-Letter Substitution;Fundamenta Informaticae;2020-09-28

2. Tree shuffle;Theoretical Computer Science;2014-02

3. Algorithmic decomposition of shuffle on words;Theoretical Computer Science;2012-10

4. On Language Decompositions and Primality;Lecture Notes in Computer Science;2011

5. Decidability of trajectory-based equations;Theoretical Computer Science;2005-11