Shuffle languages are in P

Author： Jedrzejowicz J.   Szepietowski A.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.250, Iss.1, 2001-01, pp. : 31-53

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Shuffle and scattered deletion closure of languages

By Ito M.   Kari L.   Thierrin G.  

Theoretical Computer Science, Vol. 245, Iss. 1, 2000-08 ,pp. : 115-133

Elsevier

Access to resources Recommend Favorite

Shuffle on trajectories: Syntactic constraints

By Mateescu A.   Rozenberg G.   Salomaa A.  

Theoretical Computer Science, Vol. 197, Iss. 1, 1998-05 ,pp. : 1-56

Elsevier

Access to resources Recommend Favorite

Shuffle factorization is unique

By Berstel J.   Boasson L.  

Theoretical Computer Science, Vol. 273, Iss. 1, 2002-02 ,pp. : 47-67

Elsevier

Access to resources Recommend Favorite

Free shuffle algebras in language varieties

By Bloom S.L.   Esik Z.  

Theoretical Computer Science, Vol. 163, Iss. 1, 1996-08 ,pp. : 55-98

Elsevier

Access to resources Recommend Favorite

Two mathematical notes ? new homogenised Simpson's rules and a riffle shuffle conjecture

By Andrew Alex M.  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 35, Iss. 5, 2006-06 ,pp. : 748-752

Emerald Group Publishing Ltd

Access to resources Recommend Favorite