{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:47:49Z","timestamp":1725518869257},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642370632"},{"type":"electronic","value":"9783642370649"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37064-9_21","type":"book-chapter","created":{"date-parts":[[2013,3,15]],"date-time":"2013-03-15T08:07:12Z","timestamp":1363334832000},"page":"226-237","source":"Crossref","is-referenced-by-count":2,"title":["Execution Information Rate for Some Classes of Automata"],"prefix":"10.1007","author":[{"given":"Cewei","family":"Cui","sequence":"first","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"}]},{"given":"Oscar H.","family":"Ibarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"21_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":"21_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)"},{"issue":"8","key":"21_CR3","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/S0950-5849(03)00033-8","volume":"45","author":"J.K. Chhabra","year":"2003","unstructured":"Chhabra, J.K., Aggarwal, K.K., Singh, Y.: Code and data spatial complexity: two important software understandability measures. Information and Software Technology\u00a045(8), 539\u2013546 (2003)","journal-title":"Information and Software Technology"},{"issue":"3","key":"21_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1527202.1527208","volume":"34","author":"J.K. Chhabra","year":"2009","unstructured":"Chhabra, J.K., Gupta, V.: Evaluation of object-oriented spatial complexity measures. SIGSOFT Softw. Eng. Notes\u00a034(3), 1\u20135 (2009)","journal-title":"SIGSOFT Softw. Eng. Notes"},{"key":"21_CR5","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":"21_CR6","unstructured":"Cover, T.M., Thomas, J.A.: Elements of information theory, 2nd edn. Wiley-Interscience (2006)"},{"key":"21_CR7","unstructured":"Cui, C., Dang, Z., Ibarra, O.H., Fischer, T.R.: Information rate of some classes of non-regular languages: An automata-theoretic approach (2012) (submitted)"},{"key":"21_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)"},{"issue":"1-3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0304-3975(02)00743-0","volume":"302","author":"Z. Dang","year":"2003","unstructured":"Dang, Z.: Pushdown timed automata: a binary reachability characterization and safety verification. Theor. Comput. Sci.\u00a0302(1-3), 93\u2013121 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR10","unstructured":"Douce, C.R., Layzell, P.J., Buckley, J.: Spatial measures of software complexity. In: Proc. 11th Meeting of Psychology of Programming Interest Group, Leeds (1999)"},{"key":"21_CR11","unstructured":"Halstead, M.H.: Elements of Software Science (Operating and programming systems series). Elsevier Science Inc. (1977)"},{"key":"21_CR12","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley (2007)"},{"issue":"1","key":"21_CR13","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":"21_CR14","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":"21_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":"21_CR16","doi-asserted-by":"crossref","unstructured":"Paun, G.: Membrane Computing, An Introduction. Springer (2002)","DOI":"10.1007\/978-3-642-56196-2"},{"key":"21_CR17","unstructured":"Shannon, C.E., Weaver, W.: The Mathematical Theory of Communication. University of Illinois Press (1949)"},{"issue":"2","key":"21_CR18","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/CJECE.2003.1532511","volume":"28","author":"J. Shao","year":"2003","unstructured":"Shao, J., Wang, Y.: A new measure of software complexity based on cognitive weight. Can. J. Elect. Comput. Eng.\u00a028(2), 69\u201374 (2003)","journal-title":"Can. J. Elect. Comput. Eng."},{"key":"21_CR19","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":"21_CR20","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":"21_CR21","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 and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37064-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T19:38:33Z","timestamp":1557603513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37064-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370632","9783642370649"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37064-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}