{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:43:26Z","timestamp":1725795806483},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319080185"},{"type":"electronic","value":"9783319080192"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08019-2_23","type":"book-chapter","created":{"date-parts":[[2014,6,5]],"date-time":"2014-06-05T01:09:47Z","timestamp":1401930587000},"page":"224-233","source":"Crossref","is-referenced-by-count":2,"title":["Lossiness of Communication Channels Modeled by Transducers"],"prefix":"10.1007","author":[{"given":"Oscar H.","family":"Ibarra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cewei","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhe","family":"Dang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas R.","family":"Fischer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"23_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-642-04081-8_6","volume-title":"CONCUR 2009 - Concurrency Theory","author":"E. Asarin","year":"2009","unstructured":"Asarin, E., Degorre, A.: Volume and entropy of regular timed languages: Discretization approach. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 69\u201383. Springer, Heidelberg (2009)"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0019-9958(58)90082-2","volume":"1","author":"N. Chomsky","year":"1958","unstructured":"Chomsky, N., Miller, G.A.: Finite state languages. Information and Control\u00a01, 91\u2013112 (1958)","journal-title":"Information and Control"},{"key":"23_CR4","unstructured":"Cui, C., Dang, Z., Fischer, T.R.: Bit rate of programs (2013) (submitted)"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.tcs.2013.05.040","volume":"498","author":"C. Cui","year":"2013","unstructured":"Cui, C., Dang, Z., Fischer, T.R., Ibarra, O.H.: Similarity in languages and programs. Theor. Comput. Sci.\u00a0498, 58\u201375 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1007\/978-3-662-44522-8_20"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Dang, Z.: Pushdown timed automata: a binary reachability characterization and safety verification. Theor. Comput. Sci. 302(1-3), 93\u2013121 (2003)","DOI":"10.1016\/S0304-3975(02)00743-0"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/10722167_9","volume-title":"Computer Aided Verification","author":"Z. Dang","year":"2000","unstructured":"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.\u00a01855, pp. 69\u201384. Springer, Heidelberg (2000)"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Dang, Z., Ibarra, O.H., Li, Q.: Sampling a two-way finite automaton (submitted, 2014)","DOI":"10.1007\/978-3-319-09039-9_4"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF01744569","volume":"16","author":"E.M. Gurari","year":"1983","unstructured":"Gurari, E.M., Ibarra, O.H.: A note on finite-valued and finitely ambiguous transducers. Math. Systems Theory\u00a016, 61\u201366 (1983)","journal-title":"Math. Systems Theory"},{"key":"23_CR11","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 1st edn. Addison-Wesley (1979)"},{"issue":"1","key":"23_CR12","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"O.H. Ibarra","year":"1978","unstructured":"Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. Journal of the ACM\u00a025(1), 116\u2013133 (1978)","journal-title":"Journal of the ACM"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-540-45138-9_42","volume-title":"Mathematical Foundations of Computer Science 2003","author":"O.H. Ibarra","year":"2003","unstructured":"Ibarra, O.H., Dang, Z., Egecioglu, O., Saxena, G.: Characterizations of Catalytic Membrane Computing Systems. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 480\u2013489. Springer, Heidelberg (2003)"},{"issue":"2","key":"23_CR14","first-page":"175","volume":"17","author":"F.P. Kaminger","year":"1970","unstructured":"Kaminger, F.P.: The noncomputability of the channel capacity of context-senstitive languages. Inf. Comput.\u00a017(2), 175\u2013182 (1970)","journal-title":"Inf. Comput."},{"issue":"2","key":"23_CR15","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0019-9958(70)90105-1","volume":"16","author":"W. Kuich","year":"1970","unstructured":"Kuich, W.: On the entropy of context-free languages. Information and Control\u00a016(2), 173\u2013200 (1970)","journal-title":"Information and Control"},{"key":"23_CR16","unstructured":"Li, Q., Dang, Z.: Sampling automata and programs (2013) (submitted)"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Paun, G.: Membrane Computing, An Introduction. Springer (2002)","DOI":"10.1007\/978-3-642-56196-2"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Sch\u00fctzenberger, M.P.: Sur les relations rationnelles. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol.\u00a033, pp. 209\u2013213 (1975)","DOI":"10.1007\/3-540-07407-4_22"},{"key":"23_CR19","unstructured":"Shannon, C.E., Weaver, W.: The Mathematical Theory of Communication. University of Illinois Press (1949)"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-46011-X_12","volume-title":"Developments in Language Theory","author":"L. Staiger","year":"2002","unstructured":"Staiger, L.: The entropy of lukasiewicz-languages. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol.\u00a02295, pp. 155\u2013165. Springer, Heidelberg (2002)"},{"key":"23_CR21","unstructured":"Wang, E., Cui, C., Dang, Z., Fischer, T.R., Yang, L.: Zero-knowledge blackbox testing: Where are the faults. Int\u2019l J. Foundations of Computer Science (to appear)"},{"issue":"9","key":"23_CR22","first-page":"749","volume":"27","author":"A. Weber","year":"1990","unstructured":"Weber, A.: On the valuedness of finite transducers. Acta Inf.\u00a027(9), 749\u2013780 (1990)","journal-title":"Acta Inf."},{"key":"23_CR23","unstructured":"Wich, K.: Ambiguity functions of context-free grammars and languages. PhD thesis (2004)"},{"key":"23_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1007\/3-540-45061-0_53","volume-title":"Automata, Languages and Programming","author":"G. Xie","year":"2003","unstructured":"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.\u00a02719, pp. 668\u2013680. Springer, Heidelberg (2003)"},{"key":"23_CR25","unstructured":"Yang, L., Cui, C., Dang, Z., Fischer, T.R.: An information-theoretic complexity metric for labeled graphs (2011) (in review)"}],"container-title":["Lecture Notes in Computer Science","Language, Life, Limits"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08019-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T00:52:58Z","timestamp":1558918378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08019-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080185","9783319080192"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08019-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}