Globally deterministic CD-systems of stateless R-automata with window size 1

References

• Csuhaj-Varjú , E. , Dassow , J. , Kelemen , J. and Păun , G. 1994 . Grammar Systems. A Grammatical Approach to Distribution and Cooperation , London : Gordon and Breach .
   Google Scholar
• Dassow , J. , Păun , G. and Rozenberg , G. 1997 . “ Grammar systems ” . In Handbook of Formal Languages , Edited by: Rozenberg , G. and Salomaa , A. Vol. 2 , 155 – 213 . Berlin : Springer .
   Google Scholar
• Diekert , V. and Rozenberg , G. 1995 . The Book of Traces , Edited by: Diekert , V. and Rozenberg , G. Singapore : World Scientific .
   Google Scholar
• Harju , T. and Karhumäki , J. 1997 . “ Morphisms ” . In Handbook of Formal Languages , Edited by: Rozenberg , G. and Salomaa , A. Vol. 1 , 439 – 510 . Berlin : Springer .
   Google Scholar
• Kutrib , M. , Messerschmidt , H. and Otto , F. 2008 . “ On stateless two-pushdown automata and restarting automata ” . In Automata and Formal Languages, AFL 2008, Proc , Edited by: Csuhaj-Varjú , E. and Ésik , Z. 257 – 268 . Budapest : Computer and Automation Research Institute, Hungarian Academy of Sciences .
   Google Scholar
• Kutrib , M. , Messerschmidt , H. and Otto , F. 2009 . “ On stateless deterministic restarting automata ” . In SOFSEM 2009: Theory and Practice of Computer Science, Proc , Edited by: Nielsen , M. , Kučera , A. , Miltersen , P. B. , Palamidessi , C. , Tuma , P. and Valencia , F. 353 – 364 . Berlin : Springer . Lecture Notes on Computer Science Vol. 5404
   Google Scholar
• Kutrib , M. , Messerschmidt , H. and Otto , F. 2010 . On stateless two-pushdown automata and restarting automata . Int. J. Found. Comput. Sci. , 21 : 781 – 798 . (doi:10.1142/S0129054110007556)
   Web of Science ®Google Scholar
• Messerschmidt , H. and Otto , F. 2007 . Cooperating distributed systems of restarting automata . Int. J. Found. Comput. Sci. , 18 : 1333 – 1342 . (doi:10.1142/S0129054107005376)
   Web of Science ®Google Scholar
• Messerschmidt , H. and Otto , F. 2007 . “ Strictly deterministic CD-systems of restarting automata ” . In FCT 2007, Proc , Edited by: Csuhaj-Varjú , E. and Ésik , Z. 424 – 434 . Berlin : Springer . Lecture Notes on Computer Science Vol. 4639
   Google Scholar
• Messerschmidt , H. and Otto , F. 2009 . On deterministic CD-systems of restarting automata . Int. J. Found. Comput. Sci. , 20 : 185 – 209 . (doi:10.1142/S0129054109006516)
   Web of Science ®Google Scholar
• Nagy , B. and Otto , F. 2010 . “ CD-systems of stateless deterministic R(1)-automata accept all rational trace languages ” . In LATA 2010, Proc , Edited by: Dediu , A. H. , Fernau , H. and Martin-Vide , C. 463 – 474 . Berlin : Springer . Lecture Notes on Computer Science Vol. 6031
   Google Scholar
• Nagy , B. and Otto , F. 2012 . On CD-systems of stateless deterministic R-automata with window size one . J. Comput. Syst. Sci. , 78 : 780 – 806 . (doi:10.1016/j.jcss.2011.12.009)
   Web of Science ®Google Scholar
• Nagy , B. and Otto , F. 2011 . “ Finite-state acceptors with translucent letters ” . In BILC 2011: AI Methods for Interdisciplinary Research in Language and Biology, Proc , Edited by: Bel-Enguix , G. , Dahl , V. and De La Puente , A. O. 3 – 13 . Setubal , , Portugal : SciTePress .
   Google Scholar
• Nagy , B. and Otto , F. 2011 . “ Globally deterministic CD-systems of stateless R(1)-automata ” . In LATA 2011, Proc , Edited by: Dediu , A. H. , Inenaga , S. and Martin-Vide , C. 390 – 401 . Berlin : Springer . Lecture Notes on Computer Science Vol. 6638
   Google Scholar
• Salomaa , A. 1981 . Jewels of Formal Language Theory , Rockville , MD : Computer Science Press .
   Google Scholar