{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:13:08Z","timestamp":1774987988830,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642401633","type":"print"},{"value":"9783642401640","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40164-0_10","type":"book-chapter","created":{"date-parts":[[2013,7,22]],"date-time":"2013-07-22T01:01:30Z","timestamp":1374454890000},"page":"72-83","source":"Crossref","is-referenced-by-count":6,"title":["On the Average Size of Glushkov and Equation Automata for KAT Expressions"],"prefix":"10.1007","author":[{"given":"Sabine","family":"Broda","sequence":"first","affiliation":[]},{"given":"Ant\u00f3nio","family":"Machiavelo","sequence":"additional","affiliation":[]},{"given":"Nelma","family":"Moreira","sequence":"additional","affiliation":[]},{"given":"Rog\u00e9rio","family":"Reis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Almeida, R., Broda, S., Moreira, N.: Deciding KAT and Hoare logic with derivatives. In: Faella, M., Murano, A. (eds.) Proc. 3rd GANDALF. EPTCS, vol.\u00a096, pp. 127\u2013140 (2012)","DOI":"10.4204\/EPTCS.96.10"},{"issue":"7","key":"10_CR2","doi-asserted-by":"publisher","first-page":"1593","DOI":"10.1142\/S0129054111008908","volume":"22","author":"S. Broda","year":"2011","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: On the average state complexity of partial derivative automata. International Journal of Foundations of Computer Science\u00a022(7), 1593\u20131606 (2011)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"10_CR3","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: An introduction to descriptional complexity of regular languages through analytic combinatorics. Tech. Rep. DCC-2012-05, DCC - FC, Universidade do Porto (07 2012)"},{"issue":"5","key":"10_CR4","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1142\/S0129054112400400","volume":"23","author":"S. Broda","year":"2012","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: On the average size of Glushkov and partial derivative automata. International Journal of Foundations of Computer Science\u00a023(5), 969\u2013984 (2012)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"3","key":"10_CR5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.3233\/FUN-2001-45303","volume":"45","author":"J.M. Champarnaud","year":"2001","unstructured":"Champarnaud, J.M., Ziadi, D.: From Mirkin\u2019s prebases to Antimirov\u2019s word partial derivatives. Fundam. Inform.\u00a045(3), 195\u2013205 (2001)","journal-title":"Fundam. Inform."},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0304-3975(01)00267-5","volume":"289","author":"J.M. Champarnaud","year":"2002","unstructured":"Champarnaud, J.M., Ziadi, D.: Canonical derivatives, partial derivatives and finite automaton constructions. Theoret. Comput. Sci.\u00a0289, 137\u2013163 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR7","unstructured":"Cohen, E., Kozen, D., Smith, F.: The complexity of Kleene algebra with tests. Tech. Rep. TR96-1598, Computer Science Department, Cornell University (07 1996)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. CUP (2008)","DOI":"10.1017\/CBO9780511801655"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1070\/RM1961v016n05ABEH004112","volume":"16","author":"V.M. Glushkov","year":"1961","unstructured":"Glushkov, V.M.: The abstract theory of automata. Russian Math. Surveys\u00a016, 1\u201353 (1961)","journal-title":"Russian Math. Surveys"},{"issue":"4","key":"10_CR10","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/S0022-0000(69)80027-9","volume":"3","author":"D.M. Kaplan","year":"1969","unstructured":"Kaplan, D.M.: Regular expressions and the equivalence of programs. J. Comput. Syst. Sci.\u00a03(4), 361\u2013386 (1969)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"10_CR11","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/256167.256195","volume":"19","author":"D. Kozen","year":"1997","unstructured":"Kozen, D.: Kleene algebra with tests. Trans. on Prog. Lang. and Systems\u00a019(3), 427\u2013443 (1997)","journal-title":"Trans. on Prog. Lang. and Systems"},{"key":"10_CR12","first-page":"117","volume":"24","author":"D. Kozen","year":"2003","unstructured":"Kozen, D.: Automata on guarded strings and applications. Mat\u00e9matica Contempor\u00e2nea\u00a024, 117\u2013139 (2003)","journal-title":"Mat\u00e9matica Contempor\u00e2nea"},{"key":"10_CR13","unstructured":"Kozen, D.: On the coalgebraic theory of Kleene algebra with tests. Tech. Rep., Cornell University (05 2008), http:\/\/hdl.handle.net\/1813\/10173"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-63172-0_43","volume-title":"Computer Science Logic","author":"D. Kozen","year":"1997","unstructured":"Kozen, D., Smith, F.: Kleene algebra with tests: Completeness and decidability. In: van Dalen, D., Bezem, M. (eds.) CSL 1996. LNCS, vol.\u00a01258, pp. 244\u2013259. Springer, Heidelberg (1997)"},{"key":"10_CR15","first-page":"51","volume":"5","author":"B.G. Mirkin","year":"1966","unstructured":"Mirkin, B.G.: An algorithm for constructing a base in a language of regular expressions. Engineering Cybernetics\u00a05, 51\u201357 (1966)","journal-title":"Engineering Cybernetics"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-642-00982-2_53","volume-title":"Language and Automata Theory and Applications","author":"C. Nicaud","year":"2009","unstructured":"Nicaud, C.: On the average size of Glushkov\u2019s automata. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol.\u00a05457, pp. 626\u2013637. Springer, Heidelberg (2009)"},{"key":"10_CR17","unstructured":"Silva, A.: Kleene Coalgebra. Ph.D. thesis, Radboud Universiteit Nijmegen (2010)"},{"key":"10_CR18","unstructured":"Worthington, J.: Feasibly Reducing KAT Equations to KA Equations. ArXiv e-prints (01 2008)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40164-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T13:20:56Z","timestamp":1746019256000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40164-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401633","9783642401640"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40164-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}