{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:20Z","timestamp":1759638980505,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319601335"},{"type":"electronic","value":"9783319601342"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-60134-2_17","type":"book-chapter","created":{"date-parts":[[2017,5,27]],"date-time":"2017-05-27T12:53:09Z","timestamp":1495889589000},"page":"201-212","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Syntactic Complexity of Bifix-Free Languages"],"prefix":"10.1007","author":[{"given":"Marek","family":"Szyku\u0142a","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Wittnebel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,28]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195768","volume-title":"Codes and Automata","author":"J Berstel","year":"2009","unstructured":"Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press, Cambridge (2009)"},{"issue":"1\/2","key":"17_CR2","first-page":"71","volume":"15","author":"JA Brzozowski","year":"2010","unstructured":"Brzozowski, J.A.: Quotient complexity of regular languages. J. Autom. Lang. Comb. 15(1\/2), 71\u201389 (2010)","journal-title":"J. Autom. Lang. Comb."},{"issue":"6","key":"17_CR3","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1142\/S0129054113400133","volume":"24","author":"JA Brzozowski","year":"2013","unstructured":"Brzozowski, J.A.: In search of the most complex regular languages. Int. J. Found. Comput. Sci. 24(6), 691\u2013708 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1142\/S0129054105003157","volume":"16","author":"JA Brzozowski","year":"2005","unstructured":"Brzozowski, J.A., Li, B.: Syntactic complexity of $$R$$- and $$J$$-trivial languages. Int. J. Found. Comput. Sci. 16(3), 547\u2013563 (2005)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"17_CR5","first-page":"83","volume":"17","author":"JA Brzozowski","year":"2012","unstructured":"Brzozowski, J.A., Li, B., Liu, D.: Syntactic complexities of six classes of star-free languages. J. Autom. Lang. Comb. 17, 83\u2013105 (2012)","journal-title":"J. Autom. Lang. Comb."},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.tcs.2012.04.011","volume":"449","author":"JA Brzozowski","year":"2012","unstructured":"Brzozowski, J.A., Li, B., Ye, Y.: Syntactic complexity of prefix-suffix-, bifix-, and factor-free regular languages. Theoret. Comput. Sci. 449, 37\u201353 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-319-09698-8_2","volume-title":"Developments in Language Theory","author":"J Brzozowski","year":"2014","unstructured":"Brzozowski, J., Szyku\u0142a, M.: Upper bounds on syntactic complexity of left and two-sided ideals. In: Shur, A.M., Volkov, M.V. (eds.) DLT 2014. LNCS, vol. 8633, pp. 13\u201324. Springer, Cham (2014). doi:10.1007\/978-3-319-09698-8_2"},{"issue":"07","key":"17_CR8","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1142\/S0129054115400067","volume":"26","author":"JA Brzozowski","year":"2015","unstructured":"Brzozowski, J.A., Szyku\u0142a, M.: Large aperiodic semigroups. Int. J. Found. Comput. Sci. 26(07), 913\u2013931 (2015)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-19225-3_3","volume-title":"Descriptional Complexity of Formal Systems","author":"J Brzozowski","year":"2015","unstructured":"Brzozowski, J., Szyku\u0142a, M.: Upper bound on syntactic complexity of suffix-free languages. In: Shallit, J., Okhotin, A. (eds.) DCFS 2015. LNCS, vol. 9118, pp. 33\u201345. Springer, Cham (2015). doi:10.1007\/978-3-319-19225-3_3"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2014.04.016","volume":"539","author":"JA Brzozowski","year":"2014","unstructured":"Brzozowski, J.A., Tamm, H.: Theory of \u00e1tomata. Theoret. Comput. Sci. 539, 13\u201327 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-22321-1_11","volume-title":"Developments in Language Theory","author":"J Brzozowski","year":"2011","unstructured":"Brzozowski, J., Ye, Y.: Syntactic complexity of ideal and closed languages. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 117\u2013128. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-22321-1_11"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/978-3-319-60134-2_7","volume-title":"CIAA 2017","author":"R Ferens","year":"2017","unstructured":"Ferens, R., Szyku\u0142a, M.: Complexity of bifix-free languages. In: Carayol, A., Nicaud, C. (eds.) CIAA 2017. LNCS, vol. 10329, pp. 76\u201388. Springer, Cham (2017)"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.tcs.2004.04.010","volume":"327","author":"M Holzer","year":"2004","unstructured":"Holzer, M., K\u00f6nig, B.: On deterministic finite automata and syntactic monoid size. Theoret. Comput. Sci. 327, 319\u2013347 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR14","unstructured":"Iv\u00e1n, S., Nagy-Gy\u00f6rgy, J.: On nonpermutational transformation semigroups with an application to syntactic complexity (2014). http:\/\/arxiv.org\/abs\/1402.7289"},{"key":"17_CR15","unstructured":"McNaughton, R., Papert, S.A.: Counter-free automata (M.I.T. Research Monograph No. 65). The MIT Press (1971)"},{"key":"17_CR16","unstructured":"Myhill, J.: Finite automata and representation of events. Wright Air Development Center Technical report, pp. 57\u2013624 (1957)"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Pin, J.E.: Syntactic semigroups. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Volume 1 Word, Language, Grammar, pp. 679\u2013746. Springer, Heidelberg (1997)","DOI":"10.1007\/978-3-642-59136-5_10"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Szyku\u0142a, M., Wittnebel, J.: Syntactic complexity of bifix-free languages (2017). http:\/\/arxiv.org\/abs\/1604.06936","DOI":"10.1007\/978-3-319-60134-2_17"},{"key":"17_CR19","first-page":"221","volume":"6","author":"S Yu","year":"2001","unstructured":"Yu, S.: State complexity of regular languages. J. Autom. Lang. Comb. 6, 221\u2013234 (2001)","journal-title":"J. Autom. Lang. Comb."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60134-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:32:21Z","timestamp":1710343941000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-60134-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319601335","9783319601342"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60134-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"28 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marne-la-Vall\u00e9e","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ciaa17.univ-mlv.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}