Skip to main content
SpringerLink
Log in

Lossiness of Communication Channels Modeled by Transducers

  • Conference paper
Language, Life, Limits (CiE 2014)

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

Included in the following conference series:

Abstract

We provide an automata-theoretic approach to analyzing an abstract channel modeled by a transducer and to characterizing its lossy rates. In particular, we look at related decision problems and show the boundaries between the decidable and undecidable cases.

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. 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. Chomsky, N., Miller, G.A.: Finite state languages. Information and Control 1, 91–112 (1958)

    Article  MATH  MathSciNet  Google Scholar 

  4. Cui, C., Dang, Z., Fischer, T.R.: Bit rate of programs (2013) (submitted)

    Google Scholar 

  5. Cui, C., Dang, Z., Fischer, T.R., Ibarra, O.H.: Similarity in languages and programs. Theor. Comput. Sci. 498, 58–75 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  6. Cui, C., Dang, Z., Fischer, T.R., Ibarra, O.H.: Information rate of some classes of non-regular languages: An automata-theoretic approach (submitted, 2014)

    Google Scholar 

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

    Google Scholar 

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

  9. Dang, Z., Ibarra, O.H., Li, Q.: Sampling a two-way finite automaton (submitted, 2014)

    Google Scholar 

  10. Gurari, E.M., Ibarra, O.H.: A note on finite-valued and finitely ambiguous transducers. Math. Systems Theory 16, 61–66 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  11. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 1st edn. Addison-Wesley (1979)

    Google Scholar 

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

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

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

    MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  16. Li, Q., Dang, Z.: Sampling automata and programs (2013) (submitted)

    Google Scholar 

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

    Google Scholar 

  18. Schützenberger, M.P.: Sur les relations rationnelles. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 209–213 (1975)

    Google Scholar 

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

    Google Scholar 

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

  21. Wang, E., Cui, C., Dang, Z., Fischer, T.R., Yang, L.: Zero-knowledge blackbox testing: Where are the faults. Int’l J. Foundations of Computer Science (to appear)

    Google Scholar 

  22. Weber, A.: On the valuedness of finite transducers. Acta Inf. 27(9), 749–780 (1990)

    MATH  Google Scholar 

  23. Wich, K.: Ambiguity functions of context-free grammars and languages. PhD thesis (2004)

    Google Scholar 

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

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Oscar H. Ibarra

  2. School of Electrical Engineering & Computer Science, Washington State University, Pullman, WA, 99164, USA

    Cewei Cui, Zhe Dang & Thomas R. Fischer

Authors
  1. Oscar H. Ibarra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cewei Cui
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhe Dang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Thomas R. Fischer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Science, Department of Computer Science, Swansea University, SA2 8PP, Swansea, UK

    Arnold Beckmann

  2. Department of Algorithms and Their Applications, Eötvös Loránd University, Pázmány Péter sétány 1/c,, 1117, Budapest, Hungary

    Erzsébet Csuhaj-Varjú

  3. Computer Science Institute, Brandenburg University of Technology Cottbus-Senftenberg, Cottbus, Germany

    Klaus Meer

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Ibarra, O.H., Cui, C., Dang, Z., Fischer, T.R. (2014). Lossiness of Communication Channels Modeled by Transducers. In: Beckmann, A., Csuhaj-Varjú, E., Meer, K. (eds) Language, Life, Limits. CiE 2014. Lecture Notes in Computer Science, vol 8493. Springer, Cham. https://doi.org/10.1007/978-3-319-08019-2_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08019-2_23

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08018-5

  • Online ISBN: 978-3-319-08019-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation