Regular splicing languages and subclasses-Reference-Cited by-同舟云学术

Regular splicing languages and subclasses

Published:2005-06 Issue:2 Volume:340 Page:349-363
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Bonizzoni Paola,Mauri Giancarlo

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference27 articles.

1. Codage Symbolique;Béal,1993

2. Theory of Codes;Berstel,1985

3. P. Bonizzoni, C. De Felice, G. Mauri, R. Zizza, Decision Problems on Linear and Circular Splicing, in: M. Ito, M. Toyama (Eds.), Proc. DLT 2002, Lecture Notes in Computer Science, Vol. 2450, Springer, Berlin, 2003, pp. 78–92.

4. P. Bonizzoni, C. De Felice, G. Mauri, R. Zizza, Regular Languages Generated by Reflexive Finite Linear Splicing Systems, in: Z. Esik, Z. Fülöp (Eds.), Proc. DLT 2003, Lecture Notes in Computer Science, Vol. 2710, Springer, Berlin, 2003, pp. 134–145.

5. P. Bonizzoni, C. De Felice, G. Mauri, R. Zizza, Linear splicing and syntatic monoid, 2004, submitted for publication.

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

1. Hybrid and generalized marked systems;Theoretical Computer Science;2021-11

2. Splicing System in Automata Theory : A Review;Journal of Physics: Conference Series;2019-11-01

3. How Complex is to Solve a Hard Problem with Accepting Splicing Systems;Proceedings of the 4th International Conference on Complexity, Future Information Systems and Risk;2019

4. Enforcing Regular Languages;Fundamenta Informaticae;2017-08-09

5. Existence of constants in regular splicing languages;Information and Computation;2015-06