727 lines
24 KiB
BibTeX
727 lines
24 KiB
BibTeX
|
@article{Biegler2007,
|
|||
|
|
author = {Biegler, Franziska and Burrell, Michael J. and Daley, Mark},
|
|||
|
|
title = {Regulated {RNA} Rewriting: Modelling {RNA} Editing with Guided Insertion},
|
|||
|
|
journal = {Theoretical Computer Science},
|
|||
|
|
issue_date = {2007},
|
|||
|
|
volume = {387},
|
|||
|
|
number = {2},
|
|||
|
|
month = nov,
|
|||
|
|
year = {2007},
|
|||
|
|
issn = {0304-3975},
|
|||
|
|
pages = {103--112},
|
|||
|
|
numpages = {10},
|
|||
|
|
url = {http://dx.doi.org/10.1016/j.tcs.2007.07.030},
|
|||
|
|
doi = {10.1016/j.tcs.2007.07.030},
|
|||
|
|
acmid = {1297474},
|
|||
|
|
publisher = {Elsevier Science Publishers Ltd.},
|
|||
|
|
address = {Essex, UK},
|
|||
|
|
keywords = {Formal languages, Kinetoplasts, RNA editing, Regulated rewriting},
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{MPMV98,
|
|||
|
|
author = {Marcus, Solomon and P\u{a}un, Gheorghe and Mart\'{\i}n-Vide, Carlos},
|
|||
|
|
title = {Contextual Grammars As Generative Models of Natural Languages},
|
|||
|
|
journal = {Computational Linguistics},
|
|||
|
|
issue_date = {June 1998},
|
|||
|
|
volume = {24},
|
|||
|
|
number = {2},
|
|||
|
|
month = jun,
|
|||
|
|
year = {1998},
|
|||
|
|
issn = {0891-2017},
|
|||
|
|
pages = {245--274},
|
|||
|
|
numpages = {30},
|
|||
|
|
url = {http://dl.acm.org/citation.cfm?id=972732.972735},
|
|||
|
|
acmid = {972735},
|
|||
|
|
publisher = {MIT Press},
|
|||
|
|
address = {Cambridge, MA, USA},
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@incollection{KMM97,
|
|||
|
|
year={1997},
|
|||
|
|
isbn={978-3-540-63386-0},
|
|||
|
|
booktitle={Fundamentals of Computation Theory},
|
|||
|
|
volume={1279},
|
|||
|
|
series={Lecture Notes in Computer Science},
|
|||
|
|
editor={Chlebus, Bogdan S. and Czaja, Ludwik},
|
|||
|
|
doi={10.1007/BFb0036190},
|
|||
|
|
title={Contextual grammars with distributed catenation and shuffle},
|
|||
|
|
url={http://dx.doi.org/10.1007/BFb0036190},
|
|||
|
|
publisher={Springer Berlin Heidelberg},
|
|||
|
|
author={Kudlek, Manfred and Marcus, Solomon and Mateescu, Alexandru},
|
|||
|
|
pages={269-280},
|
|||
|
|
language={English}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{Domosi20084877,
|
|||
|
|
title = "Marcus contextual languages consisting of primitive words ",
|
|||
|
|
journal = "Discrete Mathematics ",
|
|||
|
|
volume = "308",
|
|||
|
|
number = "21",
|
|||
|
|
pages = "4877 - 4881",
|
|||
|
|
year = "2008",
|
|||
|
|
note = "Chongqing 2004 Discrete Mathematics with its Application in Information Science and Related Topics ",
|
|||
|
|
issn = "0012-365X",
|
|||
|
|
doi = "http://dx.doi.org/10.1016/j.disc.2007.09.006",
|
|||
|
|
url = "http://www.sciencedirect.com/science/article/pii/S0012365X07007303",
|
|||
|
|
author = {P\'{a}l D\"{o}m\"{o}si and Masami Ito and Solomon Marcus},
|
|||
|
|
keywords = "Formal languages",
|
|||
|
|
keywords = "Automata",
|
|||
|
|
keywords = "Combinatorics of words and languages",
|
|||
|
|
keywords = "Marcus contextual grammars and languages",
|
|||
|
|
keywords = "Primitive words",
|
|||
|
|
keywords = "Strongly primitive words "
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{MP90,
|
|||
|
|
title = {Regulated {G}aliukshov semicontextual grammars},
|
|||
|
|
author = {Marcus, Monica and P\u{a}un, Gheorghe},
|
|||
|
|
journal = {Kybernetika},
|
|||
|
|
volume = {26},
|
|||
|
|
number = {4},
|
|||
|
|
pages = {316--326},
|
|||
|
|
year = {1990}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{Kari88,
|
|||
|
|
title = {Six arithmetic-like operations on languages},
|
|||
|
|
author = {Lila S\^antean},
|
|||
|
|
journal = {Revue Roumaine de Linguistique, Tome XXXIII},
|
|||
|
|
series = {Cahiers de linguistique th\'eorique et appliqu\'ee, Tome XXV},
|
|||
|
|
number = {1},
|
|||
|
|
year = {1988},
|
|||
|
|
pages = {65--73},
|
|||
|
|
note = {Lila S\^antean is Lila Kari's maiden name.}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{Kari200547,
|
|||
|
|
title = "Aspects of shuffle and deletion on trajectories ",
|
|||
|
|
journal = "Theoretical Computer Science ",
|
|||
|
|
volume = "332",
|
|||
|
|
number = "1–3",
|
|||
|
|
pages = "47 - 61",
|
|||
|
|
year = "2005",
|
|||
|
|
note = "",
|
|||
|
|
issn = "0304-3975",
|
|||
|
|
doi = "http://dx.doi.org/10.1016/j.tcs.2004.09.038",
|
|||
|
|
url = "http://www.sciencedirect.com/science/article/pii/S0304397504006863",
|
|||
|
|
author = "Lila Kari and Petr Sosík"
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article {PPJY2008,
|
|||
|
|
title = {Representations and characterizations of languages in {C}homsky hierarchy by means of insertion-deletion systems},
|
|||
|
|
journal = {International Journal of Foundations of Computer Science},
|
|||
|
|
volume = {19},
|
|||
|
|
year = {2008},
|
|||
|
|
pages = {859-871},
|
|||
|
|
publisher = {World Scientific},
|
|||
|
|
address = {London, U.K.},
|
|||
|
|
keywords = {Insertion-deletion systems; Recursively enumerable languages; Context-free languages; Regular languages; 68Q42 (AMSC); 68Q45 (AMSC); 68Q50 (AMSC)},
|
|||
|
|
issn = {0129-0541},
|
|||
|
|
doi = {10.1142/S0129054108006005},
|
|||
|
|
url = {http://dx.doi.org/10.1142/S0129054108006005},
|
|||
|
|
author = {Gheorghe P\u{a}un and Mario J. P{\'e}rez-Jim{\'e}nez and Takashi Yokomori}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{Kari2008264,
|
|||
|
|
title = "On the weight of universal insertion grammars ",
|
|||
|
|
journal = "Theoretical Computer Science ",
|
|||
|
|
volume = "396",
|
|||
|
|
number = "1–3",
|
|||
|
|
pages = "264 - 270",
|
|||
|
|
year = "2008",
|
|||
|
|
note = "",
|
|||
|
|
issn = "0304-3975",
|
|||
|
|
doi = "http://dx.doi.org/10.1016/j.tcs.2008.01.037",
|
|||
|
|
url = "http://www.sciencedirect.com/science/article/pii/S0304397508000984",
|
|||
|
|
author = "Lila Kari and Petr Sos\'ik",
|
|||
|
|
keywords = "Formal grammar",
|
|||
|
|
keywords = "Contextual insertion",
|
|||
|
|
keywords = "\{DNA\} computing "
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{KRV2011,
|
|||
|
|
year={2011},
|
|||
|
|
issn={1567-7818},
|
|||
|
|
journal={Natural Computing},
|
|||
|
|
volume={10},
|
|||
|
|
number={2},
|
|||
|
|
doi={10.1007/s11047-010-9208-y},
|
|||
|
|
title={Computational power of insertion-deletion ({P}) systems with rules of size two},
|
|||
|
|
url={http://dx.doi.org/10.1007/s11047-010-9208-y},
|
|||
|
|
publisher={Springer Netherlands},
|
|||
|
|
keywords={Insertion–deletion systems; P systems; Decidability; Universality; Computational completeness},
|
|||
|
|
author={Krassovitskiy, Alexander and Rogozhin, Yurii and Verlan, Sergey},
|
|||
|
|
pages={835-852},
|
|||
|
|
language={English}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@incollection{KRV2008,
|
|||
|
|
year={2008},
|
|||
|
|
isbn={978-3-540-88281-7},
|
|||
|
|
booktitle={Language and Automata Theory and Applications},
|
|||
|
|
volume={5196},
|
|||
|
|
series={Lecture Notes in Computer Science},
|
|||
|
|
editor={Mart\'in-Vide, Carlos and Otto, Friedrich and Fernau, Henning},
|
|||
|
|
doi={10.1007/978-3-540-88282-4_31},
|
|||
|
|
title={Further Results on Insertion-Deletion Systems with One-Sided Contexts},
|
|||
|
|
url={http://dx.doi.org/10.1007/978-3-540-88282-4_31},
|
|||
|
|
publisher={Springer Berlin Heidelberg},
|
|||
|
|
keywords={Insertion-deletion systems; universality; computational non-completeness},
|
|||
|
|
author={Krassovitskiy, Alexander and Rogozhin, Yurii and Verlan, Serghey},
|
|||
|
|
pages={333-344},
|
|||
|
|
language={English}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@phdthesis{Krassovitskiy2011,
|
|||
|
|
author = {Alexander Krassovitskiy},
|
|||
|
|
title = {Complexity and Modeling Power of Insertion-Deletion Systems},
|
|||
|
|
school = {Departament de Filologies Rom\'aniques, Universitat Rovira and Virgili},
|
|||
|
|
year = {2011}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@incollection{Zantema2010,
|
|||
|
|
year={2010},
|
|||
|
|
isbn={978-3-642-13088-5},
|
|||
|
|
booktitle={Language and Automata Theory and Applications},
|
|||
|
|
volume={6031},
|
|||
|
|
series={Lecture Notes in Computer Science},
|
|||
|
|
editor={Dediu, Adrian-Horia and Fernau, Henning and Mart\'in-Vide, Carlos},
|
|||
|
|
doi={10.1007/978-3-642-13089-2_51},
|
|||
|
|
title={Complexity of Guided Insertion-Deletion in {RNA}-Editing},
|
|||
|
|
url={http://dx.doi.org/10.1007/978-3-642-13089-2_51},
|
|||
|
|
publisher={Springer Berlin Heidelberg},
|
|||
|
|
author={Zantema, Hans},
|
|||
|
|
pages={608-619},
|
|||
|
|
language={English}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@incollection{CMVMS2001,
|
|||
|
|
year={2001},
|
|||
|
|
isbn={978-3-540-42235-8},
|
|||
|
|
booktitle={Connectionist Models of Neurons, Learning Processes, and Artificial Intelligence},
|
|||
|
|
volume={2084},
|
|||
|
|
series={Lecture Notes in Computer Science},
|
|||
|
|
editor={Mira, José and Prieto, Alberto},
|
|||
|
|
doi={10.1007/3-540-45720-8_74},
|
|||
|
|
title={Solving {NP}-Complete Problems with Networks of Evolutionary Processors},
|
|||
|
|
url={http://dx.doi.org/10.1007/3-540-45720-8_74},
|
|||
|
|
publisher={Springer Berlin Heidelberg},
|
|||
|
|
author={Castellanos, Juan and Mart\'in-Vide, Carlos and Mitrana, Victor and Sempere, Jose M.},
|
|||
|
|
pages={621-628},
|
|||
|
|
language={English}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{CVMVM2005,
|
|||
|
|
year={2005},
|
|||
|
|
issn={0001-5903},
|
|||
|
|
journal={Acta Informatica},
|
|||
|
|
volume={41},
|
|||
|
|
number={4-5},
|
|||
|
|
doi={10.1007/s00236-004-0158-7},
|
|||
|
|
title={Hybrid networks of evolutionary processors are computationally complete},
|
|||
|
|
url={http://dx.doi.org/10.1007/s00236-004-0158-7},
|
|||
|
|
publisher={Springer-Verlag},
|
|||
|
|
author={Csuhaj-Varj\'u, Erzs\'ebet and Mart\'in-Vide, Carlos and Mitrana, Victor},
|
|||
|
|
pages={257-272},
|
|||
|
|
language={English}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@incollection{AFR2014,
|
|||
|
|
year={2014},
|
|||
|
|
isbn={978-3-319-08122-9},
|
|||
|
|
booktitle={Unconventional Computation and Natural Computation},
|
|||
|
|
series={Lecture Notes in Computer Science},
|
|||
|
|
editor={Ibarra, Oscar H. and Kari, Lila and Kopecki, Steffen},
|
|||
|
|
doi={10.1007/978-3-319-08123-6_1},
|
|||
|
|
title={Five Nodes Are Sufficient for Hybrid Networks of Evolutionary Processors to Be Computationally Complete},
|
|||
|
|
url={http://dx.doi.org/10.1007/978-3-319-08123-6_1},
|
|||
|
|
publisher={Springer International Publishing},
|
|||
|
|
author={Alhazov, Artiom and Freund, Rudolf and Rogozhin, Yurii},
|
|||
|
|
pages={1-13},
|
|||
|
|
language={English}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{IRV2014,
|
|||
|
|
author = {Sergiu Ivanov and
|
|||
|
|
Yurii Rogozhin and
|
|||
|
|
Sergey Verlan},
|
|||
|
|
title = {Small Universal Networks of Evolutionary Processors},
|
|||
|
|
journal = {Journal of Automata, Languages and Combinatorics},
|
|||
|
|
volume = {19},
|
|||
|
|
number = {1-4},
|
|||
|
|
pages = {133--144},
|
|||
|
|
year = {2014},
|
|||
|
|
timestamp = {Tue, 09 Sep 2014 16:47:07 +0200},
|
|||
|
|
biburl = {http://dblp.uni-trier.de/rec/bib/journals/jalc/0001RV14},
|
|||
|
|
bibsource = {dblp computer science bibliography, http://dblp.org}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@inproceedings{Motwani2000,
|
|||
|
|
author = {Motwani, Rajeev and Panigrahy, Rina and Saraswat, Vijay and Ventkatasubramanian, Suresh},
|
|||
|
|
title = {On the Decidability of Accessibility Problems (Extended Abstract)},
|
|||
|
|
booktitle = {Proceedings of the Thirty-second Annual ACM Symposium on Theory of Computing},
|
|||
|
|
series = {STOC '00},
|
|||
|
|
year = {2000},
|
|||
|
|
isbn = {1-58113-184-4},
|
|||
|
|
location = {Portland, Oregon, USA},
|
|||
|
|
pages = {306--315},
|
|||
|
|
numpages = {10},
|
|||
|
|
url = {http://doi.acm.org/10.1145/335305.335341},
|
|||
|
|
doi = {10.1145/335305.335341},
|
|||
|
|
acmid = {335341},
|
|||
|
|
publisher = {ACM},
|
|||
|
|
address = {New York, NY, USA},
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@incollection{JL2005,
|
|||
|
|
year={2005},
|
|||
|
|
isbn={978-3-540-28193-1},
|
|||
|
|
booktitle={Fundamentals of Computation Theory},
|
|||
|
|
volume={3623},
|
|||
|
|
series={Lecture Notes in Computer Science},
|
|||
|
|
editor={Li\'skiewicz, Maciej and Reischuk, Rüdiger},
|
|||
|
|
doi={10.1007/11537311_26},
|
|||
|
|
title={Leftist Grammars and the Chomsky Hierarchy},
|
|||
|
|
url={http://dx.doi.org/10.1007/11537311_26},
|
|||
|
|
publisher={Springer Berlin Heidelberg},
|
|||
|
|
author={Jurdzi\'nski, Tomasz and Lory\'s, Krzysztof},
|
|||
|
|
pages={293-304},
|
|||
|
|
language={English}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@incollection{CS2010,
|
|||
|
|
year={2010},
|
|||
|
|
isbn={978-3-642-12031-2},
|
|||
|
|
booktitle={Foundations of Software Science and Computational Structures},
|
|||
|
|
volume={6014},
|
|||
|
|
series={Lecture Notes in Computer Science},
|
|||
|
|
editor={Ong, Luke},
|
|||
|
|
doi={10.1007/978-3-642-12032-9_17},
|
|||
|
|
title={Toward a Compositional Theory of Leftist Grammars and Transformations},
|
|||
|
|
url={http://dx.doi.org/10.1007/978-3-642-12032-9_17},
|
|||
|
|
publisher={Springer Berlin Heidelberg},
|
|||
|
|
author={Chambart, Pierre and Schnoebelen, Philippe},
|
|||
|
|
pages={237-251},
|
|||
|
|
language={English}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@incollection{Jurdzinski2006,
|
|||
|
|
year={2006},
|
|||
|
|
isbn={978-3-540-35907-4},
|
|||
|
|
booktitle={Automata, Languages and Programming},
|
|||
|
|
volume={4052},
|
|||
|
|
series={Lecture Notes in Computer Science},
|
|||
|
|
editor={Bugliesi, Michele and Preneel, Bart and Sassone, Vladimiro and Wegener, Ingo},
|
|||
|
|
doi={10.1007/11787006_37},
|
|||
|
|
title={On Complexity of Grammars Related to the Safety Problem},
|
|||
|
|
url={http://dx.doi.org/10.1007/11787006_37},
|
|||
|
|
publisher={Springer Berlin Heidelberg},
|
|||
|
|
author={Jurdzi\'nski, Tomasz},
|
|||
|
|
pages={432-443},
|
|||
|
|
language={English}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@incollection{Jurdzinski2008,
|
|||
|
|
year={2008},
|
|||
|
|
isbn={978-3-540-70582-6},
|
|||
|
|
booktitle={Automata, Languages and Programming},
|
|||
|
|
volume={5126},
|
|||
|
|
series={Lecture Notes in Computer Science},
|
|||
|
|
editor={Aceto, Luca and Damg\r{a}rd, Ivan and Goldberg, Leslie Ann and Halld\'orsson, Magn\'us M. and Ing\'olfsd\'ottir, Anna and Walukiewicz, Igor},
|
|||
|
|
doi={10.1007/978-3-540-70583-3_5},
|
|||
|
|
title={Leftist Grammars Are Non-primitive Recursive},
|
|||
|
|
url={http://dx.doi.org/10.1007/978-3-540-70583-3_5},
|
|||
|
|
publisher={Springer Berlin Heidelberg},
|
|||
|
|
author={Jurdzi\'nski, Tomasz},
|
|||
|
|
pages={51-62},
|
|||
|
|
language={English}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{VZB2013,
|
|||
|
|
title={{RNA}-Editing with Combined Insertion and Deletion Preserves Regularity},
|
|||
|
|
author={Erik P. de Vink and Hans Zantema and Dragan Bo\v{s}na\v{c}ki},
|
|||
|
|
journal={Scientific Annals of Computer Science},
|
|||
|
|
volume={23},
|
|||
|
|
number={1},
|
|||
|
|
organization={``A.I. Cuza'' University, Ia\c si, Rom\^ania},
|
|||
|
|
year={2013},
|
|||
|
|
pages={39--73},
|
|||
|
|
doi={10.7561/SACS.2013.1.39},
|
|||
|
|
publisher={``A.I. Cuza'' University Press, Ia\c si}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@booklet{VerlanHdR,
|
|||
|
|
title={Study of language-theoretic computational paradigms inspired by biology},
|
|||
|
|
author={Sergey Verlan},
|
|||
|
|
note={Habilation thesis},
|
|||
|
|
school={University of Paris Est},
|
|||
|
|
address={Paris},
|
|||
|
|
year={2010}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@incollection{IV2014,
|
|||
|
|
year={2014},
|
|||
|
|
isbn={978-3-642-54238-1},
|
|||
|
|
booktitle={Membrane Computing},
|
|||
|
|
volume={8340},
|
|||
|
|
series={Lecture Notes in Computer Science},
|
|||
|
|
editor={Alhazov, Artiom and Cojocaru, Svetlana and Gheorghe, Marian and Rogozhin, Yurii and Rozenberg, Grzegorz and Salomaa, Arto},
|
|||
|
|
doi={10.1007/978-3-642-54239-8_16},
|
|||
|
|
title={About One-Sided One-Symbol Insertion-Deletion {P} Systems},
|
|||
|
|
url={http://dx.doi.org/10.1007/978-3-642-54239-8_16},
|
|||
|
|
publisher={Springer Berlin Heidelberg},
|
|||
|
|
author={Ivanov, Sergiu and Verlan, Sergey},
|
|||
|
|
pages={225-237},
|
|||
|
|
language={English}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{IV2011,
|
|||
|
|
author = {Sergiu Ivanov and
|
|||
|
|
Sergey Verlan},
|
|||
|
|
title = {Random Context and Semi-Conditional Insertion-Deletion Systems},
|
|||
|
|
journal = {CoRR},
|
|||
|
|
volume = {abs/1112.5947},
|
|||
|
|
year = {2011},
|
|||
|
|
url = {http://arxiv.org/abs/1112.5947},
|
|||
|
|
timestamp = {Tue, 06 May 2014 14:48:13 +0200},
|
|||
|
|
biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1112-5947},
|
|||
|
|
bibsource = {dblp computer science bibliography, http://dblp.org}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{Verlan10,
|
|||
|
|
author = {Sergey Verlan},
|
|||
|
|
title = {Recent Developments on Insertion-Deletion Systems},
|
|||
|
|
journal = {The Computer Science Journal of Moldova},
|
|||
|
|
volume = {18},
|
|||
|
|
number = {2},
|
|||
|
|
pages = {210--245},
|
|||
|
|
year = {2010},
|
|||
|
|
url = {http://www.math.md/publications/csjm/issues/v18-n2/10288/},
|
|||
|
|
timestamp = {Fri, 03 Jun 2011 12:54:20 +0200},
|
|||
|
|
biburl = {http://dblp.uni-trier.de/rec/bib/journals/csjm/Verlan10a},
|
|||
|
|
bibsource = {dblp computer science bibliography, http://dblp.org}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{PN1980,
|
|||
|
|
author = {Gheorghe P\u aun and Nguyen Xuan My},
|
|||
|
|
title = {On the inner contextual grammars},
|
|||
|
|
journal = {Revue Roumaine de Math\' ematiques Pures et Appliqu\' ees},
|
|||
|
|
volume = {25},
|
|||
|
|
pages = {641--651},
|
|||
|
|
year={1980}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@inproceedings{MVMMVP1995,
|
|||
|
|
author = {Carlos Mart\'in-Vide and Alexandru Mateescu and Joan Miquel-Verg\'es and Gheorghe P\u{a}un},
|
|||
|
|
title = {Internal Contextual Grammars: Minimal, Maximal, and Scattered Use of Selectors},
|
|||
|
|
booktitle = {Proceedings of the Fourth Bar-Ilan Symposium on Foundations of Artificial Intelligence},
|
|||
|
|
year = {1995}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@booklet{BurrellMSc,
|
|||
|
|
author = {Michael J. Burrell},
|
|||
|
|
title = {Computational Modelling of Uridine Insertion and Deletion in
|
|||
|
|
Kinetoplastid {RNA}, {M}aster's {T}hesis},
|
|||
|
|
school = {University of Western Ontario},
|
|||
|
|
address = {London, Canada},
|
|||
|
|
year = {2005}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{SAHS97,
|
|||
|
|
author = {Kenneth Stuart and Thomas E. Allen and Stefan Heidmann and Scott D. Seiwert},
|
|||
|
|
title = {{RNA} Editing in Kinetoplastid Protozoa},
|
|||
|
|
journal = {Microbiology and Molecular Biology Reviews},
|
|||
|
|
year = {1997},
|
|||
|
|
volume = {61},
|
|||
|
|
number = {1},
|
|||
|
|
publisher = {American Society for Microbiology}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{Benne92,
|
|||
|
|
year={1992},
|
|||
|
|
issn={0301-4851},
|
|||
|
|
journal={Molecular Biology Reports},
|
|||
|
|
volume={16},
|
|||
|
|
number={4},
|
|||
|
|
doi={10.1007/BF00419661},
|
|||
|
|
title={{RNA} editing in trypanosomes},
|
|||
|
|
url={http://dx.doi.org/10.1007/BF00419661},
|
|||
|
|
publisher={Kluwer Academic Publishers},
|
|||
|
|
keywords={guide RNA; mitochondrion; RNA editing; trypanosomes},
|
|||
|
|
author={Benne, Robert},
|
|||
|
|
pages={217-227},
|
|||
|
|
language={English}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{Fujioka201369,
|
|||
|
|
title = "Morphic characterizations with insertion systems controlled by a context of length one ",
|
|||
|
|
journal = "Theoretical Computer Science ",
|
|||
|
|
volume = "469",
|
|||
|
|
number = "0",
|
|||
|
|
pages = "69--76",
|
|||
|
|
year = "2013",
|
|||
|
|
note = "",
|
|||
|
|
issn = "0304-3975",
|
|||
|
|
doi = "http://dx.doi.org/10.1016/j.tcs.2012.10.003",
|
|||
|
|
url = "http://www.sciencedirect.com/science/article/pii/S0304397512009103",
|
|||
|
|
author = "Kaoru Fujioka",
|
|||
|
|
keywords = "Insertion system",
|
|||
|
|
keywords = "Morphic characterization",
|
|||
|
|
keywords = "Strictly locally testable language "
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{Fujioka2011397,
|
|||
|
|
title = "Morphic characterizations of languages in {C}homsky hierarchy with insertion and locality ",
|
|||
|
|
journal = "Information and Computation ",
|
|||
|
|
volume = "209",
|
|||
|
|
number = "3",
|
|||
|
|
pages = "397 - 408",
|
|||
|
|
year = "2011",
|
|||
|
|
note = "3rd International Conference on Language and Automata Theory and Applications (LATA 2009) ",
|
|||
|
|
issn = "0890-5401",
|
|||
|
|
doi = "http://dx.doi.org/10.1016/j.ic.2010.11.011",
|
|||
|
|
url = "http://www.sciencedirect.com/science/article/pii/S0890540110001963",
|
|||
|
|
author = "Kaoru Fujioka",
|
|||
|
|
keywords = "Insertion system",
|
|||
|
|
keywords = "Strictly locally testable language",
|
|||
|
|
keywords = "Chomsky-Schützenberger theorem "
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{CMVMS2003,
|
|||
|
|
year={2003},
|
|||
|
|
issn={0001-5903},
|
|||
|
|
journal={Acta Informatica},
|
|||
|
|
volume={39},
|
|||
|
|
number={6-7},
|
|||
|
|
doi={10.1007/s00236-003-0114-y},
|
|||
|
|
title={Networks of evolutionary processors},
|
|||
|
|
url={http://dx.doi.org/10.1007/s00236-003-0114-y},
|
|||
|
|
publisher={Springer-Verlag},
|
|||
|
|
author={Castellanos, Juan and Martín-Vide, Carlos and Mitrana, Victor and Sempere, José M.},
|
|||
|
|
pages={517-529},
|
|||
|
|
language={English}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{AMVR2006,
|
|||
|
|
year={2006},
|
|||
|
|
issn={0001-5903},
|
|||
|
|
journal={Acta Informatica},
|
|||
|
|
volume={43},
|
|||
|
|
number={5},
|
|||
|
|
doi={10.1007/s00236-006-0024-x},
|
|||
|
|
title={On the number of nodes in universal networks of evolutionary processors},
|
|||
|
|
url={http://dx.doi.org/10.1007/s00236-006-0024-x},
|
|||
|
|
publisher={Springer-Verlag},
|
|||
|
|
author={Alhazov, Artiom and Mart\'in-Vide, Carlos and Rogozhin, Yurii},
|
|||
|
|
pages={331-339},
|
|||
|
|
language={English}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@incollection{FKO2011,
|
|||
|
|
year={2011},
|
|||
|
|
isbn={978-3-642-19999-8},
|
|||
|
|
booktitle={Computation, Cooperation, and Life},
|
|||
|
|
volume={6610},
|
|||
|
|
series={Lecture Notes in Computer Science},
|
|||
|
|
editor={Kelemen, Jozef and Kelemenová, Alica},
|
|||
|
|
doi={10.1007/978-3-642-20000-7_5},
|
|||
|
|
title={A General Framework for Regulated Rewriting Based on the Applicability of Rules},
|
|||
|
|
url={http://dx.doi.org/10.1007/978-3-642-20000-7_5},
|
|||
|
|
publisher={Springer Berlin Heidelberg},
|
|||
|
|
author={Freund, Rudolf and Kogler, Marian and Oswald, Marion},
|
|||
|
|
pages={35-53},
|
|||
|
|
language={English}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@book{handbook,
|
|||
|
|
title={Handbook of Formal Languages},
|
|||
|
|
editor={Rozenberg, Grzegorz and Salomaa, Arto},
|
|||
|
|
year={1997},
|
|||
|
|
publisher={Springer, Berlin}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@book{DP1989,
|
|||
|
|
author = {Dassow, Jrgen and Paun, Gheorghe},
|
|||
|
|
title = {Regulated Rewriting in Formal Language Theory},
|
|||
|
|
year = {2012},
|
|||
|
|
isbn = {3642749348, 9783642749346},
|
|||
|
|
edition = {1st},
|
|||
|
|
publisher = {Springer Publishing Company, Incorporated},
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{Woods2009443,
|
|||
|
|
title = "The complexity of small universal {T}uring machines: A survey ",
|
|||
|
|
journal = "Theoretical Computer Science ",
|
|||
|
|
volume = "410",
|
|||
|
|
number = "4–5",
|
|||
|
|
pages = "443 - 450",
|
|||
|
|
year = "2009",
|
|||
|
|
note = "Computational Paradigms from Nature ",
|
|||
|
|
issn = "0304-3975",
|
|||
|
|
doi = "http://dx.doi.org/10.1016/j.tcs.2008.09.051",
|
|||
|
|
url = "http://www.sciencedirect.com/science/article/pii/S0304397508007287",
|
|||
|
|
author = "Damien Woods and Turlough Neary",
|
|||
|
|
keywords = "Small universal Turing machines",
|
|||
|
|
keywords = "Computational complexity",
|
|||
|
|
keywords = "Polynomial time",
|
|||
|
|
keywords = "Simulation",
|
|||
|
|
keywords = "Tag systems",
|
|||
|
|
keywords = "Cellular automata "
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{Geffert91,
|
|||
|
|
author = {Viliam Geffert},
|
|||
|
|
title = {Normal forms for phrase-structure grammars},
|
|||
|
|
journal = {{ITA}},
|
|||
|
|
volume = {25},
|
|||
|
|
pages = {473--498},
|
|||
|
|
year = {1991},
|
|||
|
|
timestamp = {Fri, 27 Feb 2004 11:18:15 +0100},
|
|||
|
|
biburl = {http://dblp.uni-trier.de/rec/bib/journals/ita/Geffert91},
|
|||
|
|
bibsource = {dblp computer science bibliography, http://dblp.org}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@PHDTHESIS{phdRogojin,
|
|||
|
|
title = {Gene Assembly in Stichotrichous Ciliates: Elementary Operations, Parallelism and Computation},
|
|||
|
|
author = {Rogojin, Vladimir},
|
|||
|
|
number = {117},
|
|||
|
|
series = {TUCS Dissertations},
|
|||
|
|
school = {Turku Centre for Computer Science},
|
|||
|
|
year = {2009},
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@inproceedings{DT10,
|
|||
|
|
author = {J{\"{u}}rgen Dassow and
|
|||
|
|
Bianca Truthe},
|
|||
|
|
title = {On Networks of Evolutionary Processors with State Limited Filters},
|
|||
|
|
booktitle = {Second Workshop on Non-Classical Models for Automata and Applications
|
|||
|
|
- {NCMA} 2010, Jena, Germany, August 23 - August 24, 2010. Proceedings},
|
|||
|
|
pages = {57--70},
|
|||
|
|
year = {2010},
|
|||
|
|
crossref = {DBLP:conf/ncma/2010},
|
|||
|
|
timestamp = {Fri, 21 Oct 2011 16:16:47 +0200},
|
|||
|
|
biburl = {http://dblp.uni-trier.de/rec/bib/conf/ncma/DassowT10},
|
|||
|
|
bibsource = {dblp computer science bibliography, http://dblp.org}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@proceedings{DBLP:conf/ncma/2010,
|
|||
|
|
editor = {Henning Bordihn and
|
|||
|
|
Rudolf Freund and
|
|||
|
|
Markus Holzer and
|
|||
|
|
Thomas Hinze and
|
|||
|
|
Martin Kutrib and
|
|||
|
|
Friedrich Otto},
|
|||
|
|
title = {Second Workshop on Non-Classical Models for Automata and Applications
|
|||
|
|
- {NCMA} 2010, Jena, Germany, August 23 - August 24, 2010. Proceedings},
|
|||
|
|
series = {books@ocg.at},
|
|||
|
|
volume = {263},
|
|||
|
|
publisher = {Austrian Computer Society},
|
|||
|
|
year = {2010},
|
|||
|
|
isbn = {978-3-85403-263-2},
|
|||
|
|
timestamp = {Fri, 21 Oct 2011 16:16:05 +0200},
|
|||
|
|
biburl = {http://dblp.uni-trier.de/rec/bib/conf/ncma/2010},
|
|||
|
|
bibsource = {dblp computer science bibliography, http://dblp.org}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{DMT13,
|
|||
|
|
author = {J{\"{u}}rgen Dassow and
|
|||
|
|
Florin Manea and
|
|||
|
|
Bianca Truthe},
|
|||
|
|
title = {Networks of evolutionary processors: the power of subregular filters},
|
|||
|
|
journal = {Acta Inf.},
|
|||
|
|
volume = {50},
|
|||
|
|
number = {1},
|
|||
|
|
pages = {41--75},
|
|||
|
|
year = {2013},
|
|||
|
|
url = {http://dx.doi.org/10.1007/s00236-012-0172-0},
|
|||
|
|
doi = {10.1007/s00236-012-0172-0},
|
|||
|
|
timestamp = {Tue, 05 Feb 2013 13:06:52 +0100},
|
|||
|
|
biburl = {http://dblp.uni-trier.de/rec/bib/journals/acta/DassowMT13},
|
|||
|
|
bibsource = {dblp computer science bibliography, http://dblp.org}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{AKRV11,
|
|||
|
|
title = "P systems with minimal insertion and deletion ",
|
|||
|
|
journal = "Theoretical Computer Science ",
|
|||
|
|
volume = "412",
|
|||
|
|
number = "1–2",
|
|||
|
|
pages = "136 - 144",
|
|||
|
|
year = "2011",
|
|||
|
|
issn = "0304-3975",
|
|||
|
|
doi = "http://dx.doi.org/10.1016/j.tcs.2010.08.025",
|
|||
|
|
url = "http://www.sciencedirect.com/science/article/pii/S0304397510004603",
|
|||
|
|
author = "Artiom Alhazov and Alexander Krassovitskiy and Yurii Rogozhin and Sergey Verlan",
|
|||
|
|
keywords = "Insertion–deletion systems",
|
|||
|
|
keywords = "Membrane computing",
|
|||
|
|
keywords = "Universality "
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@inproceedings{FKRV10,
|
|||
|
|
author = {Rudolf Freund and
|
|||
|
|
Marian Kogler and
|
|||
|
|
Yurii Rogozhin and
|
|||
|
|
Sergey Verlan},
|
|||
|
|
title = {Graph-Controlled Insertion-Deletion Systems},
|
|||
|
|
booktitle = {Proceedings Twelfth Annual Workshop on Descriptional Complexity of
|
|||
|
|
Formal Systems, {DCFS} 2010, Saskatoon, Canada, 8-10th August 2010.},
|
|||
|
|
pages = {88--98},
|
|||
|
|
year = {2010},
|
|||
|
|
crossref = {DBLP:journals/corr/abs-1008-1270},
|
|||
|
|
url = {http://dx.doi.org/10.4204/EPTCS.31.11},
|
|||
|
|
doi = {10.4204/EPTCS.31.11},
|
|||
|
|
timestamp = {Mon, 28 Oct 2013 16:56:55 +0100},
|
|||
|
|
biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1008-1651},
|
|||
|
|
bibsource = {dblp computer science bibliography, http://dblp.org}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@proceedings{DBLP:journals/corr/abs-1008-1270,
|
|||
|
|
editor = {Ian McQuillan and
|
|||
|
|
Giovanni Pighizzini},
|
|||
|
|
title = {Proceedings Twelfth Annual Workshop on Descriptional Complexity of
|
|||
|
|
Formal Systems, {DCFS} 2010, Saskatoon, Canada, 8-10th August 2010},
|
|||
|
|
series = {{EPTCS}},
|
|||
|
|
volume = {31},
|
|||
|
|
year = {2010},
|
|||
|
|
url = {http://dx.doi.org/10.4204/EPTCS.31},
|
|||
|
|
doi = {10.4204/EPTCS.31},
|
|||
|
|
timestamp = {Mon, 28 Oct 2013 16:56:55 +0100},
|
|||
|
|
biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1008-1270},
|
|||
|
|
bibsource = {dblp computer science bibliography, http://dblp.org}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{Petre201280,
|
|||
|
|
title = "Matrix insertion-deletion systems ",
|
|||
|
|
journal = "Theoretical Computer Science ",
|
|||
|
|
volume = "456",
|
|||
|
|
number = "0",
|
|||
|
|
pages = "80 - 88",
|
|||
|
|
year = "2012",
|
|||
|
|
note = "",
|
|||
|
|
issn = "0304-3975",
|
|||
|
|
doi = "http://dx.doi.org/10.1016/j.tcs.2012.07.002",
|
|||
|
|
url = "http://www.sciencedirect.com/science/article/pii/S0304397512006470",
|
|||
|
|
author = "Ion Petre and Sergey Verlan",
|
|||
|
|
keywords = "Insertion–deletion systems",
|
|||
|
|
keywords = "Matrix control",
|
|||
|
|
keywords = "Formal languages",
|
|||
|
|
keywords = "Computational completeness "
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@article{Choudhary2007111,
|
|||
|
|
title = "Network of evolutionary processors with splicing rules and permitting context ",
|
|||
|
|
journal = "Biosystems ",
|
|||
|
|
volume = "87",
|
|||
|
|
number = "2–3",
|
|||
|
|
pages = "111 - 116",
|
|||
|
|
year = "2007",
|
|||
|
|
issn = "0303-2647",
|
|||
|
|
doi = "http://dx.doi.org/10.1016/j.biosystems.2006.09.003",
|
|||
|
|
url = "http://www.sciencedirect.com/science/article/pii/S0303264706001559",
|
|||
|
|
author = "Ashish Choudhary and Kamala Krithivasan",
|
|||
|
|
keywords = "Evolutionary processors",
|
|||
|
|
keywords = "Splicing rules",
|
|||
|
|
keywords = "Permitting context",
|
|||
|
|
keywords = "Forbidding context",
|
|||
|
|
keywords = "Filters "
|
|||
|
|
}
|