Skip to main content
SpringerLink
Log in

Two-Head Finite-State Acceptors with Translucent Letters

  • Conference paper
  • First Online:
SOFSEM 2019: Theory and Practice of Computer Science (SOFSEM 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11376))

Abstract

Finite-state acceptors are studied that have two heads that read the input from opposite sides. In addition, a set of translucent letters is associated with each state. It is shown that these two-head automata are strictly more expressive than the model with a single head, but that they still only accept languages that have a semi-linear Parikh image. In fact, we obtain a characterization for the class of linear context-free trace languages in terms of a specific class of two-head finite-state acceptors with translucent letters.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bedregal, B.R.C.: Some subclasses of linear languages based on nondeterministic linear automata. arXiv:10276v1 (2016)

  2. Diekert, V., Rozenberg, G.: The Book of Traces. World Scientific, Singapore (1995)

    Book  Google Scholar 

  3. Freund, R., Păun, Gh., Rozenberg, G., Salomaa, A.: Watson-Crick finite automata. In: Rubin, H., Wood, D.H. (eds.) DNA Based Computers, Proceedings of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 297–328. DIMACS/AMS (1999)

    Google Scholar 

  4. Greibach, S.: A note on undecidable properties of formal languages. Math. Syst. Theory 2, 1–6 (1968)

    Article  MathSciNet  Google Scholar 

  5. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  6. Meduna, A., Zemek, P.: Jumping finite automata. Int. J. Found. Comput. Sci. 23, 1555–1578 (2012)

    Article  MathSciNet  Google Scholar 

  7. Nagy, B.: On \(5^{\prime } \rightarrow 3^{\prime }\) sensing Watson-Crick finite automata. In: Garzon, M.H., Yan, H. (eds.) DNA 2007. LNCS, vol. 4848, pp. 256–262. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-77962-9_27

    Chapter  Google Scholar 

  8. Nagy, B.: A class of 2-head finite automata for linear languages. Triangle: Lang. Math. Approaches 8, 89–99 (2012)

    Google Scholar 

  9. Nagy, B.: On a hierarchy of \(5^{\prime } \rightarrow 3^{\prime }\)sensing Watson-Crick finite automata languages. J. Log. Comput. 23, 855–872 (2013)

    Article  MathSciNet  Google Scholar 

  10. Nagy, B., Kovács, L.: Finite automata with translucent letters applied in natural and formal language theory. In: Nguyen, N.T., Kowalczyk, R., Fred, A., Joaquim, F. (eds.) Transactions on Computational Collective Intelligence XVII. LNCS, vol. 8790, pp. 107–127. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-44994-3_6

    Chapter  Google Scholar 

  11. Nagy, B., Otto, F.: CD-systems of stateless deterministic R(1)-automata accept all rational trace languages. In: Dediu, A.-H., Fernau, H., Martín-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 463–474. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13089-2_39

    Chapter  MATH  Google Scholar 

  12. Nagy, B., Otto, F.: An automata-theoretical characterization of context-free trace languages. In: Černá, I., et al. (eds.) SOFSEM 2011. LNCS, vol. 6543, pp. 406–417. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-18381-2_34

    Chapter  Google Scholar 

  13. Nagy, B., Otto, F.: CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store. RAIRO Theor. Inform. Appl. 45, 413–448 (2011)

    Article  MathSciNet  Google Scholar 

  14. Nagy, B., Otto, F.: Finite-state acceptors with translucent letters. In: Bel-Enguix, G., Dahl, V., De La Puente, A.O. (eds.) BILC 2011: AI Methods for Interdisciplinary Research in Language and Biology, Proceedings, pp. 3–13. SciTePress, Portugal (2011)

    Google Scholar 

  15. Nagy, B., Otto, F.: On CD-systems of stateless deterministic R-automata with window size one. J. Comput. Syst. Sci. 78, 780–806 (2012)

    Article  MathSciNet  Google Scholar 

  16. Nagy, B., Otto, F.: Globally deterministic CD-systems of stateless R-automata with window size 1. Int. J. Comput. Math. 90, 1254–1277 (2013)

    Article  MathSciNet  Google Scholar 

  17. Rosenberg, A.L.: On multi-head finite automata. IBM J. Res. Dev. 10, 388–394 (1966)

    Article  MathSciNet  Google Scholar 

  18. Rosenberg, A.L.: A machine realization of the linear context-free languages. Inf. Control 10, 175–188 (1967)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Faculty of Arts and Sciences, Eastern Mediterranean University, Famagusta, North Cyprus, via Mersin 10, Turkey

    Benedek Nagy

  2. Fachbereich Elektrotechnik/Informatik, Universität Kassel, 34109, Kassel, Germany

    Friedrich Otto

Authors
  1. Benedek Nagy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Friedrich Otto
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Friedrich Otto .

Editor information

Editors and Affiliations

  1. University of Genoa, Genoa, Italy

    Barbara Catania

  2. Comenius University, Bratislava, Slovakia

    Rastislav Královič

  3. Poznań University of Technology, Poznań, Poland

    Jerzy Nawrocki

  4. Università degli Studi di Milano, Milan, Italy

    Giovanni Pighizzini

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nagy, B., Otto, F. (2019). Two-Head Finite-State Acceptors with Translucent Letters. In: Catania, B., Královič, R., Nawrocki, J., Pighizzini, G. (eds) SOFSEM 2019: Theory and Practice of Computer Science. SOFSEM 2019. Lecture Notes in Computer Science(), vol 11376. Springer, Cham. https://doi.org/10.1007/978-3-030-10801-4_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-10801-4_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-10800-7

  • Online ISBN: 978-3-030-10801-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation