Shuffle and scattered deletion closure of languages

Authors:
Masami Ito;Lila Kari;Gabriel Thierrin
Affiliations:
Kyoto Sangyo Univ., Kyoto, Japan;Univ. of Western Ontario, London, Ont., Canada;Univ. of Western Ontario, London, Ont., Canada
Venue:
Theoretical Computer Science
Year:
2000

Shuffle Quotient and Decompositions

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Representing recursively enumerable languages by iterated deletion

Theoretical Computer Science
Deletion along trajectories

Theoretical Computer Science
Minimal forbidden subwords

Information Processing Letters
Aspects of shuffle and deletion on trajectories

Theoretical Computer Science
Well quasi-orders generated by a word-shuffle rewriting

Theoretical Computer Science
Well Quasi-orders in Formal Language Theory

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Minimal forbidden subwords

Information Processing Letters
On language decompositions and primality

Rainbow of computer science
Substitutions, trajectories and noisy channels

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Avoidable sets and well quasi-orders

DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Well quasi orders and the shuffle closure of finite sets

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Tree shuffle

Theoretical Computer Science

Hi-index	5.23