Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 90, 2013 - Issue 6: LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS – LATA 2011
Submit an article Journal homepage
59
Views
11
CrossRef citations to date
0
Altmetric
Section A

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

Benedek Nagy Department of Computer Science, Faculty of Informatics, University of Debrecen, 4032 Debrecen, Egyetem tér 1, Hungary
&
Friedrich Otto Fachbereich Elektrotechnik/Informatik, Universität Kassel, 34109, Kassel, GermanyCorrespondence[email protected]
Pages 1254-1277 | Received 26 Aug 2011, Accepted 23 Apr 2012, Published online: 22 May 2012

Citations (11)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (2)

Valentin E. Brimkov & Reneta P. Barneva. (2013) Selected topics of combinatorial image analysis. International Journal of Computer Mathematics 90:8, pages 1568-1570.
Read now
Shunsuke Inenaga & Carlos Martín-Vide. (2013) Foreword. International Journal of Computer Mathematics 90:6, pages 1129-1131.
Read now

Articles from other publishers (9)

Benedek Nagy. (2023) State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters. Electronic Proceedings in Theoretical Computer Science 386, pages 170-184.
Crossref
František Mráz & Friedrich Otto. (2023) Non-returning deterministic and nondeterministic finite automata with translucent letters. RAIRO - Theoretical Informatics and Applications 57, pages 8.
Crossref
Friedrich Otto. 2023. Implementation and Application of Automata. Implementation and Application of Automata 21 50 .
František Mráz & Friedrich Otto. (2022) Non-Returning Finite Automata With Translucent Letters. Electronic Proceedings in Theoretical Computer Science 367, pages 143-159.
Crossref
Benedek Nagy. (2021) State-deterministic $$5'\rightarrow 3'$$ Watson-Crick automata. Natural Computing 20:4, pages 725-737.
Crossref
Benedek Nagy & Friedrich Otto. (2020) Linear automata with translucent letters and linear context-free trace languages. RAIRO - Theoretical Informatics and Applications 54, pages 3.
Crossref
Benedek Nagy & Friedrich Otto. 2019. SOFSEM 2019: Theory and Practice of Computer Science. SOFSEM 2019: Theory and Practice of Computer Science 406 418 .
Friedrich Otto. 2015. SOFSEM 2015: Theory and Practice of Computer Science. SOFSEM 2015: Theory and Practice of Computer Science 389 400 .
Benedek Nagy & László Kovács. 2014. Transactions on Computational Collective Intelligence XVII. Transactions on Computational Collective Intelligence XVII 107 127 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.