On bonded indian and uniformly parallel insertion systems and their generative power
暂无分享,去创建一个
Bianca Truthe | Sherzod Turaev | Markus Holzer | Ahmad Firdaus Yosman | Fong Wan Heng | M. Holzer | S. Turaev | B. Truthe
[1] Gheorghe Paun,et al. Deletion Sets , 1993, Fundam. Informaticae.
[2] Lila Kari,et al. Block insertion and deletion on trajectories , 2011, Theor. Comput. Sci..
[3] Lila Kari,et al. Shuffle and scattered deletion closure of languages , 2000, Theor. Comput. Sci..
[4] Lila Kari,et al. On Insertion and Deletion in Formal Languages , 1991 .
[5] Lila Kari,et al. Contextual Insertions/Deletions and Computability , 1996, Inf. Comput..
[6] Lila Kari,et al. Insertion and Deletion of Words: Determinism and Reversibility , 1992, MFCS.
[7] Alexander Krassovitskiy,et al. Complexity and modeling power of insertion-deletion systems , 2011 .
[8] Gheorghe Paun,et al. On Parallel Deletions Applied to a Word , 1995, RAIRO Theor. Informatics Appl..
[9] Gheorghe Paun,et al. At the crossroads of DNA computing and formal languages: Characterizing recursively enumerable languages using insertion-deletion systems , 1997, DNA Based Computers.
[10] Lila Kari,et al. Insertion and Deletion Closure of Languages , 1997, Theor. Comput. Sci..
[11] Grzegorz Rozenberg,et al. Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.
[12] Grzegorz Rozenberg,et al. The mathematical theory of L systems , 1980 .
[13] Sherzod Turaev,et al. On bonded sequential and parallel insertion systems , 2018, RAIRO Theor. Informatics Appl..
[14] Lila Kari,et al. Generalized Derivatives , 1993, Fundam. Informaticae.