Skip to main content
SpringerLink
Log in

Two-symbol DOS systems generating regular languages

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

We prove that it is decidable whether a two-symbol DOS system generates a regular language.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ehrenfeucht, A.H., Rozenberg, G.: DOS Systems and Languages. Proc. 7th ICALP, LNCS 85, 134–141 (1980)

    Google Scholar 

  2. Hagauer, J.: A Simple Variable Free Grammar Generating a Nonregular Language. Bull. EATCS 6, 28–33 (1979)

    Google Scholar 

  3. Harrison, M.A.: Introduction to Formal Language Theory. Reading: Addison Wesley 1978

    Google Scholar 

  4. Harju, T., Penttonen, M.: Some Decidability Problems of Sentential Forms. Internat. J. Comput. Math. 7, 95–108 (1979)

    Google Scholar 

  5. Linna, M.: On the Regularity Problem of SF-Languages Generated by Minimal Linear Grammars. Proc. 3rd FCT, LNCS 117, 244–249 (1981)

    Google Scholar 

  6. Maurer, H.A., Salomaa, A., Wood, D.: Pure Grammars. Information and Control 44, 47–72 (1980)

    Google Scholar 

  7. Salomaa, A.: On Sentential Forms of Context-Free Grammars. Acta Informat. 2, 40–49 (1973)

    Google Scholar 

  8. Salomaa, A.: Comparative Decision Problems between Sequential and Parallel Rewriting. Proc. Intern. Symp. Uniformly Structured Automata and Logic, Tokyo 1975

Download references

Author information

Authors and Affiliations

  1. Institut für Informationsverarbeitung, Technische Universität Graz, Schießstattgasse 4a, A-8010, Graz, Austria

    W. Bucher

Authors
  1. W. Bucher
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bucher, W. Two-symbol DOS systems generating regular languages. Acta Informatica 20, 133–142 (1983). https://doi.org/10.1007/BF00289411

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00289411

Keywords

Search

Navigation