The expressive power of the shuffle product-Reference-Cited by-同舟云学术

The expressive power of the shuffle product

Published:2010-11 Issue:11 Volume:208 Page:1258-1272
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Berstel Jean,Boasson Luc,Carton Olivier,Pin Jean-Éric,Restivo Antonio

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference14 articles.

1. Finite Semigroups and Universal Algebra;Almeida,1994

2. Process Algebra;Baeten,1990

3. Shuffle on positive varieties of languages;Cano Gómez;Theoret. Comput. Sci.,2004

4. A. Cano Gómez, J.-E. Pin, A robust class of regular languages, in: E. Ochmanski, J. Tyszkiewicz (Eds.), Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25–29, 2008, Berlin, Lect. Notes Comp. Sci., vol. 5162, Springer, 2008, pp. 36–51.

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

1. State complexity bounds for projection, shuffle, union, intersection, up- and downward closure and interior on commutative regular languages;Information and Computation;2024-08

2. Regularity Conditions for Iterated Shuffle on Commutative Regular Languages;International Journal of Foundations of Computer Science;2023-09-02

3. Automata-Theoretical Regularity Characterizations for the Iterated Shuffle on Commutative Regular Languages;Developments in Language Theory;2022

4. Shuffle Product of Regular Languages: Results and Open Problems;Algebraic Informatics;2022

5. Regularity Conditions for Iterated Shuffle on Commutative Regular Languages;Implementation and Application of Automata;2021