Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 2014: Mathematical Foundations of Computer Science 2014 pp 232–243Cite as

Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach

(Extended Abstract)

  • Conference paper

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

Abstract

We show that the information rate of the language accepted by a reversal-bounded deterministic counter machine is computable. For the nondeterministic case, we provide computable upper bounds. For the class of languages accepted by multi-tape deterministic finite automata, the information rate is computable as well.

The full version of this paper is at http://www.eecs.wsu.edu/zdang/papers/rateFULL.pdf

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  2. Asarin, E., Degorre, A.: Volume and entropy of regular timed languages: Discretization approach. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 69–83. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  3. Baker, B.S., Book, R.V.: Reversal-bounded multipushdown machines. J. Comput. Syst. Sci. 8(3), 315–332 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chomsky, N., Miller, G.A.: Finite state languages. Information and Control 1, 91–112 (1958)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dang, Z.: Pushdown timed automata: A binary reachability characterization and safety verification. Theor. Comput. Sci. 1-3(302), 93–121 (2003)

    Google Scholar 

  6. Dang, Z., Ibarra, O.H., Bultan, T., Kemmerer, R.A., Su, J.: Binary reachability analysis of discrete pushdown timed automata. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 69–84. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. Hansel, G., Perrin, D., Simon, I.: Compression and Entropy. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol. 577, pp. 513–528. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  8. Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. Journal of the ACM 25(1), 116–133 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  9. Ibarra, O.H., Dang, Z., Egecioglu, O., Saxena, G.: Characterizations of Catalytic Membrane Computing Systems. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 480–489. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  10. Kaminger, F.P.: The noncomputability of the channel capacity of context-senstitive languages. Inf. Comput. 17(2), 175–182 (1970)

    MATH  MathSciNet  Google Scholar 

  11. Kuich, W.: On the entropy of context-free languages. Information and Control 16(2), 173–200 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  12. Kuich, W., Maurer, H.: The structure generating function and entropy of tuple languages. Information and Control 19(3), 195–203 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  13. Parikh, R.J.: On Context-Free Languages. J. ACM 13(4), 570–581 (1966)

    Article  MATH  MathSciNet  Google Scholar 

  14. Paun, G.: Membrane Computing, An Introduction. Springer (2002)

    Google Scholar 

  15. Shannon, C.E., Weaver, W.: The Mathematical Theory of Communication. University of Illinois Press (1949)

    Google Scholar 

  16. Staiger, L.: The entropy of Lukasiewicz-languages. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol. 2295, pp. 155–165. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  17. Xie, G., Dang, Z., Ibarra, O.H.: A solvable class of quadratic Diophantine equations with applications to verification of infinite state systems. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 668–680. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  18. Yang, L., Cui, C., Dang, Z., Fischer, T.R.: An information-theoretic complexity metric for labeled graphs (2011) (in review)

    Google Scholar 

  19. Yang, L., Dang, Z., Fischer, T.R.: Information gain of black-box testing. Form. Asp. Comput. 23(4), 513–539 (2011)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA, 99164, USA

    Cewei Cui, Zhe Dang & Thomas R. Fischer

  2. Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA

    Oscar H. Ibarra

Authors
  1. Cewei Cui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhe Dang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Thomas R. Fischer
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Oscar H. Ibarra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Informatics, Eötvös Loránd University, Pázmány Péter sétány 1/C, 1117, Budapest, Hungary

    Erzsébet Csuhaj-Varjú

  2. Fakultät für Informatik und Automatisierung, Technische Universität Ilmenau, Helmholtzplatz, 598693, Ilmenau, Germany

    Martin Dietzfelbinger

  3. Institute of Informatics, Szeged University, Tisza Lajos krt. 103, 6720, Szeged, Hungary

    Zoltán Ésik

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag GmbH Berlin Heidelberg

About this paper

Cite this paper

Cui, C., Dang, Z., Fischer, T.R., Ibarra, O.H. (2014). Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds) Mathematical Foundations of Computer Science 2014. MFCS 2014. Lecture Notes in Computer Science, vol 8634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44522-8_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-44522-8_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-44521-1

  • Online ISBN: 978-3-662-44522-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation