{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:36:16Z","timestamp":1725888976935},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319602516"},{"type":"electronic","value":"9783319602523"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-60252-3_6","type":"book-chapter","created":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T14:59:13Z","timestamp":1496415553000},"page":"77-88","source":"Crossref","is-referenced-by-count":2,"title":["On the Average Complexity of Strong Star Normal Form"],"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","published-online":{"date-parts":[[2017,6,3]]},"reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0304-3975(95)00182-4","volume":"155","author":"VM Antimirov","year":"1996","unstructured":"Antimirov, V.M.: Partial derivatives of regular expressions and finite automaton constructions. Theor. Comput. Sci. 155(2), 291\u2013319 (1996)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"6_CR2","doi-asserted-by":"crossref","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: an analytic combinatorics approach. Int. J. Found. Comput. Sci. 22(7), 1593\u20131606 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.tcs.2014.02.013","volume":"528","author":"S Broda","year":"2014","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: A hitchhiker\u2019s guide to descriptional complexity through analytic combinatorics. Theor. Comput. Sci. 528, 85\u2013100 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR4","first-page":"167","volume":"116","author":"S Broda","year":"2015","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: Average size of automata constructions from regular expressions. BEATCS 116, 167\u2013192 (2015)","journal-title":"BEATCS"},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0304-3975(93)90287-4","volume":"48","author":"A Br\u00fcggemann-Klein","year":"1993","unstructured":"Br\u00fcggemann-Klein, A.: Regular expressions into finite automata. Theor. Comput. Sci. 48, 197\u2013213 (1993)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"6_CR6","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1142\/S021819670700355X","volume":"17","author":"JM Champarnaud","year":"2007","unstructured":"Champarnaud, J.M., Ouardi, F., Ziadi, D.: Normalized expressions and finite automata. Int. J. Algebra Comput. 17(1), 141\u2013154 (2007)","journal-title":"Int. J. Algebra Comput."},{"key":"6_CR7","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0304-3975(01)00267-5","volume":"289","author":"JM Champarnaud","year":"2002","unstructured":"Champarnaud, J.M., Ziadi, D.: Canonical derivatives, partial derivatives and finite automaton constructions. Theor. Comput. Sci. 289, 137\u2013163 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR8","volume-title":"Analytic Combinatorics","author":"P Flajolet","year":"2008","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. CUP, Cambridge (2008)"},{"issue":"5","key":"6_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1070\/RM1961v016n05ABEH004112","volume":"16","author":"VM Glushkov","year":"1961","unstructured":"Glushkov, V.M.: The abstract theory of automata. Russ. Math. Surv. 16(5), 1\u201353 (1961)","journal-title":"Russ. Math. Surv."},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-642-13089-2_24","volume-title":"Language and Automata Theory and Applications","author":"H Gruber","year":"2010","unstructured":"Gruber, H., Gulan, S.: Simplifying regular expressions. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 285\u2013296. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-13089-2_24"},{"key":"6_CR11","unstructured":"Gulan, S.: On the relative descriptional complexity of regular expressions and finite automata. Ph.D. thesis, Universit\u00e4t Trier (2011)"},{"key":"6_CR12","unstructured":"Gulan, S., Fernau, H.: Local elimination-strategies in automata for shorter regular expressions. In: Geffert, V., Karhum\u00e4ki, J., Bertoni, A., Preneel, B., N\u00e1vrat, P., Bielikov\u00e1, M. (eds.) SOFSEM 2008, Vol. II, pp. 46\u201357 (2008)"},{"key":"6_CR13","volume-title":"Analytic Function Theory","author":"E Hille","year":"1962","unstructured":"Hille, E.: Analytic Function Theory, vol. 2. Blaisdell Publishing Company, New York (1962)"},{"issue":"1","key":"6_CR14","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/S0890-5401(03)00090-7","volume":"186","author":"L Ilie","year":"2003","unstructured":"Ilie, L., Yu, S.: Follow automata. Inf. Comput. 186(1), 140\u2013162 (2003)","journal-title":"Inf. Comput."},{"key":"6_CR15","series-title":"Graduate Texts in Mathematics","volume-title":"Algebra","author":"S Lang","year":"2001","unstructured":"Lang, S.: Algebra. Graduate Texts in Mathematics, vol. 211, 3rd edn. Springer, New York (2001)","edition":"3"},{"issue":"4","key":"6_CR16","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1145\/321088.321097","volume":"8","author":"G Ott","year":"1961","unstructured":"Ott, G., Feinstein, N.H.: Design of sequential machines from their regular expressions. J. ACM 8(4), 585\u2013600 (1961)","journal-title":"J. ACM"},{"key":"6_CR17","unstructured":"Project FAdo: tools for formal languages manipulation. \nhttp:\/\/fado.dcc.up.pt\n\n. Accessed Feb 2017"},{"issue":"6","key":"6_CR18","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1145\/363347.363387","volume":"11","author":"K Thompson","year":"1968","unstructured":"Thompson, K.: Regular expression search algorithm. Commun. ACM 11(6), 410\u2013422 (1968)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60252-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T15:00:53Z","timestamp":1496415653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60252-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319602516","9783319602523"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60252-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}