{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:31:50Z","timestamp":1743021110978,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319948119"},{"type":"electronic","value":"9783319948126"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-94812-6_26","type":"book-chapter","created":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T22:12:26Z","timestamp":1530223946000},"page":"312-323","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Syntactic Complexity of Circular Semi-flower Automata"],"prefix":"10.1007","author":[{"given":"Shubh N.","family":"Singh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. V.","family":"Krishna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,29]]},"reference":[{"issue":"8\u201310","key":"26_CR1","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/j.tcs.2010.11.021","volume":"412","author":"M Beaudry","year":"2011","unstructured":"Beaudry, M., Holzer, M.: On the size of inverse semigroups given by generators. Theor. Comput. Sci. 412(8\u201310), 765\u2013772 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR2","series-title":"Pure and Applied Mathematics","volume-title":"Theory of Codes","author":"J Berstel","year":"1985","unstructured":"Berstel, J., Perrin, D.: Theory of Codes. Pure and Applied Mathematics, vol. 117. Academic Press Inc., Orlando (1985)"},{"issue":"38\u201340","key":"26_CR3","doi-asserted-by":"publisher","first-page":"3925","DOI":"10.1016\/j.tcs.2009.06.005","volume":"410","author":"MT Biskup","year":"2009","unstructured":"Biskup, M.T., Plandowski, W.: Shortest synchronizing strings for Huffman codes. Theor. Comput. Sci. 410(38\u201340), 3925\u20133941 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR4","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). https:\/\/doi.org\/10.1007\/978-3-642-22321-1_11"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.tcs.2012.04.011","volume":"449","author":"J Brzozowski","year":"2012","unstructured":"Brzozowski, J., Li, B., Ye, Y.: Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages. Theor. Comput. Sci. 449, 37\u201353 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"2\u20134","key":"26_CR6","first-page":"83","volume":"17","author":"J Brzozowski","year":"2012","unstructured":"Brzozowski, J., Li, B., Liu, D.: Syntactic complexities of six classes of star-free languages. J. Autom. Lang. Comb. 17(2\u20134), 83\u2013105 (2012)","journal-title":"J. Autom. Lang. Comb."},{"issue":"7","key":"26_CR7","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1142\/S0129054114400097","volume":"25","author":"J Brzozowski","year":"2014","unstructured":"Brzozowski, J., Li, B.: Syntactic complexity of R- and J-trivial regular languages. Int. J. Found. Comput. Sci. 25(7), 807\u2013821 (2014)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"26_CR8","unstructured":"Brzozowski, J., Szykula, M., Ye, Y.: Syntactic complexity of regular ideals (2015). http:\/\/arxiv.org\/abs\/1509.06032"},{"issue":"1\u20133","key":"26_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1051\/ita\/1998321-300211","volume":"32","author":"L Dubuc","year":"1998","unstructured":"Dubuc, L.: Sur les automates circulaires et la conjecture de \u010cern\u00fd. RAIRO Inform. Th\u00e9or. Appl. 32(1\u20133), 21\u201334 (1998)","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"26_CR10","unstructured":"Giambruno, L.: Automata-theoretic methods in free monoids and free groups. Ph.D. thesis, Universit\u00e0 degli Studi di Palermo, Palermo, Italy (2007)"},{"issue":"3","key":"26_CR11","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1051\/ita:2008014","volume":"42","author":"L Giambruno","year":"2008","unstructured":"Giambruno, L., Restivo, A.: An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid. Theor. Inform. Appl. 42(3), 503\u2013524 (2008)","journal-title":"Theor. Inform. Appl."},{"issue":"3","key":"26_CR12","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. Theor. Comput. Sci. 327(3), 319\u2013347 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"26_CR13","doi-asserted-by":"publisher","first-page":"687","DOI":"10.14232\/actacyb.22.3.2016.9","volume":"22","author":"S Iv\u00e1n","year":"2016","unstructured":"Iv\u00e1n, S., Nagy-Gy\u00f6rgy, J.: On nonpermutational transformation semigroups with an application to syntactic complexity. Acta Cybernet. 22(3), 687\u2013701 (2016)","journal-title":"Acta Cybernet."},{"issue":"3","key":"26_CR14","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1142\/S0129054105003157","volume":"16","author":"B Krawetz","year":"2005","unstructured":"Krawetz, B., Lawrence, J., Shallit, J.: State complexity and the monoid of transformations of a finite set. Int. J. Found. Comput. Sci. 16(3), 547\u2013563 (2005)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"26_CR15","volume-title":"Finite Automata","author":"MV Lawson","year":"2004","unstructured":"Lawson, M.V.: Finite Automata. Chapman & Hall\/CRC, Boca Raton (2004)"},{"key":"26_CR16","first-page":"1266","volume":"194","author":"AN Maslov","year":"1970","unstructured":"Maslov, A.N.: Estimates of the number of states of finite automata. Dokl. Akad. Nauk SSSR 194, 1266\u20131268 (1970)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/3-540-08860-1_25","volume-title":"Automata, Languages and Programming","author":"JE Pin","year":"1978","unstructured":"Pin, J.E.: Sur un cas particulier de la conjecture de \u010cern\u00fd. In: Ausiello, G., B\u00f6hm, C. (eds.) ICALP 1978. LNCS, vol. 62, pp. 345\u2013352. Springer, Heidelberg (1978). https:\/\/doi.org\/10.1007\/3-540-08860-1_25"},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1134\/S0001434611090094","volume":"90","author":"EV Pribavkina","year":"2011","unstructured":"Pribavkina, E.V.: Slowly synchronizing automata with zero and noncomplete sets. Math. Notes 90, 411\u2013417 (2011)","journal-title":"Math. Notes"},{"key":"26_CR19","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-642-21254-3_38","volume-title":"Language and Automata Theory and Applications","author":"Michel Rigo","year":"2011","unstructured":"Rigo, M., Vandomme, \u00c9.: Syntactic complexity of ultimately periodic sets of integers. In: LATA, pp. 477\u2013488 (2011)"},{"issue":"1\u20134","key":"26_CR20","doi-asserted-by":"crossref","first-page":"175","DOI":"10.3233\/FI-2012-677","volume":"116","author":"A Lacroix","year":"2012","unstructured":"Lacroix, A., Rampersad, N., Rigo, M., Vandomme, \u00c9.: Syntactic complexity of ultimately periodic sets of integers and application to a decision procedure. Fundam. Inform. 116(1\u20134), 175\u2013187 (2012)","journal-title":"Fundam. Inform."},{"key":"26_CR21","unstructured":"Singh, S.N.: Semi-flower automata. Ph.D. thesis, IIT Guwahati, India (2012)"},{"key":"26_CR22","first-page":"113","volume":"40","author":"SN Singh","year":"2012","unstructured":"Singh, S.N., Krishna, K.V.: The rank and Hanna Neumann property of some submonoids of a free monoid. Ann. Math. Inform. 40, 113\u2013123 (2012)","journal-title":"Ann. Math. Inform."},{"key":"26_CR23","doi-asserted-by":"publisher","first-page":"791","DOI":"10.14232\/actacyb.22.4.2016.4","volume":"22","author":"SN Singh","year":"2016","unstructured":"Singh, S.N., Krishna, K.V.: The holonomy decomposition of some circular semi-flower automata. Acta Cybernet. 22, 791\u2013805 (2016)","journal-title":"Acta Cybernet."},{"issue":"3","key":"26_CR24","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s00233-012-9449-4","volume":"86","author":"SN Singh","year":"2013","unstructured":"Singh, S.N., Krishna, K.V.: A sufficient condition for the Hanna Neumann property of submonoids of a free monoid. Semigroup Forum 86(3), 537\u2013554 (2013)","journal-title":"Semigroup Forum"}],"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-94812-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:54:54Z","timestamp":1709826894000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94812-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319948119","9783319948126"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94812-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 June 2018","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":"Charlottetown, PE","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.smcs.upei.ca\/ciaa2018","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}