Skip to main content
SpringerLink
Log in

Refining the Hierarchy of Blind Multicounter Languages

  • Conference paper
  • First Online:
STACS 2001 (STACS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2010))

Included in the following conference series:

Abstract

We show that the families (k; r)RBC of languages accepted (in quasi-realtime) by one-way counter automata having k blind counters of which r are reversal-bounded form a strict and linear hierarchy of semi- AFLs. This hierarchy comprises the families BLIND =M∩(C1) of blind multicounter languages with generator C1:={w ∈ {a1,b1*}∣ ∣w∣ai= ∣ w∣bi} and RBC=M∩(B1) of reversal-bounded multicounter languages with generator B1:={an 1bn 1∣n ∈ ℕ. This generalizes and sharpens the known results from [Grei 78] and [Jant 98].

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Berstel, Transductions and Context-free Languages, Teubner Stuttgart (1980).

    Google Scholar 

  2. P.C. Fischer, A.R. Meyer, and A.L. Rosenberg. Counter machines and counter languages, Math. Syst. Theory, 2 1968 265–283.

    MATH  MathSciNet  Google Scholar 

  3. S. Ginsburg, Algebraic and Automata Theoretic Properties of Formal Languages, North Holland Publ. Comp. Amsterdam (1975).

    Google Scholar 

  4. S. Ginsburg and S. Greibach, Principal AFL, J. Comput. Syst. Sci., 4 (1970) 308–338.

    MATH  MathSciNet  Google Scholar 

  5. S. Greibach. Remarks on the complexity of nondeterministic counter languages, Theoretical Computer Science, 1 (1976) 269–288.

    Article  MATH  MathSciNet  Google Scholar 

  6. S. Greibach. Remarks on blind and partially blind one-way multicounter machines, Theoretical Computer Science, 7 (1978) 311–324.

    Article  MATH  MathSciNet  Google Scholar 

  7. J. Hromkovič. Hierarchy of reversal bounded one-way multicounter machines, Kybernetika, 22 (1986) 200–206.

    MathSciNet  MATH  Google Scholar 

  8. M. Jantzen. On the hierarchy of Petri net languages, R.A.I.R.O., Informatique Théorique, 13 (1979) 19–30.

    MATH  MathSciNet  Google Scholar 

  9. M. Jantzen. On twist-closed trios: A new morphic characterization of the r.e. sets. In: Foundations of Computer Science, Lecture Notes in Comput. Sci., vol 1337, Springer-Verlag, Heidelberg (1997) 135–142.

    Google Scholar 

  10. M. Jantzen. Hierarchies of principal twist-closed trios, In: Proceedings of 15th Internat. Symp. on Theoretical Aspects of Computer Science, STACS’ 98, Paris, Lecture Notes in Comput. Sci., vol 1373, Springer-Verlag, Heidelberg (1998) 344–355.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB Informatik, Universität Hamburg, Vogt-Kölln-Straβe 30, 22527, Hamburg

    Matthias Jantzen & Alexy Kurganskyy

Authors
  1. Matthias Jantzen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexy Kurganskyy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. I3S & INRIA Sophia Antipolis INRIA, CNRS, 2004 Route des Lucioles, 06902, Sophia-Antipolis, France

    Afonso Ferreira

  2. Institut für Theoretische Informatik, Fakultät Informatik, TU Dresden, 01062, Dresden, Germany

    Horst Reichel

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jantzen, M., Kurganskyy, A. (2001). Refining the Hierarchy of Blind Multicounter Languages. In: Ferreira, A., Reichel, H. (eds) STACS 2001. STACS 2001. Lecture Notes in Computer Science, vol 2010. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44693-1_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-44693-1_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41695-1

  • Online ISBN: 978-3-540-44693-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation