{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:49:21Z","timestamp":1725731361091},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642393099"},{"type":"electronic","value":"9783642393105"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39310-5_16","type":"book-chapter","created":{"date-parts":[[2013,6,14]],"date-time":"2013-06-14T01:33:15Z","timestamp":1371173595000},"page":"160-171","source":"Crossref","is-referenced-by-count":4,"title":["Syntactic Complexity of ${\\mathcal R}$ - and ${\\mathcal J}$ -Trivial Regular Languages"],"prefix":"10.1007","author":[{"given":"Janusz","family":"Brzozowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baiyu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/0022-0000(80)90003-3","volume":"20","author":"J. Brzozowski","year":"1980","unstructured":"Brzozowski, J., Fich, F.E.: Languages of \n                  \n                    \n                  \n                  ${\\mathcal R}\\\/$\n                -trivial monoids. J. Comput. System Sci.\u00a020(1), 32\u201349 (1980)","journal-title":"J. Comput. System Sci."},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-31623-4_9","volume-title":"Descriptional Complexity of Formal Systems","author":"J. Brzozowski","year":"2012","unstructured":"Brzozowski, J., Li, B.: Syntactic complexities of some classes of star-free languages. In: Kutrib, M., Moreira, N., Reis, R. (eds.) DCFS 2012. LNCS, vol.\u00a07386, pp. 117\u2013129. Springer, Heidelberg (2012)"},{"key":"16_CR3","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. Theoret. Comput. Sci.\u00a0449, 37\u201353 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR4","unstructured":"Brzozowski, J., Liu, D.: Syntactic complexity of finite\/cofinite, definite, and reverse definite languages (June 2012), \n                  \n                    http:\/\/arxiv.org\/abs\/1203.2873"},{"key":"16_CR5","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.\u00a06795, pp. 117\u2013128. Springer, Heidelberg (2011)"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Ganyushkin, O., Mazorchuk, V.: Classical Finite Transformation Semigroups: An Introduction. Springer (2009)","DOI":"10.1007\/978-1-84800-281-4"},{"issue":"3","key":"16_CR7","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.\u00a0327(3), 319\u2013347 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-31606-7_20","volume-title":"Implementation and Application of Automata","author":"G. Jir\u00e1skov\u00e1","year":"2012","unstructured":"Jir\u00e1skov\u00e1, G., Masopust, T.: On the state and computational complexity of the reverse of acyclic minimal DFAs. In: Moreira, N., Reis, R. (eds.) CIAA 2012. LNCS, vol.\u00a07381, pp. 229\u2013239. Springer, Heidelberg (2012)"},{"key":"16_CR9","unstructured":"Kl\u00edma, O., Pol\u00e1k, L.: On biautomata. In: Freund, R., Holzer, M., Mereghetti, C., Otto, F., Palano, B. (eds.) Proceedings of the Third Workshop on Non-Classical Models for Automata and Applications - NCMA 2011, Milan, Italy, July 18-19, vol.\u00a0282, pp. 153\u2013164. Austrian Computer Society (2011)"},{"key":"16_CR10","unstructured":"Krawetz, B., Lawrence, J., Shallit, J.: State complexity and the monoid of transformations of a finite set (2003), \n                  \n                    http:\/\/arxiv.org\/abs\/math\/0306416v1"},{"key":"16_CR11","first-page":"1266","volume":"194","author":"A.N. Maslov","year":"1970","unstructured":"Maslov, A.N.: Estimates of the number of states of finite automata. Dokl. Akad. Nauk SSSR\u00a0194, 1266\u20131268 (1970) (Russian); English translation: Soviet Math. Dokl. 11, 1373\u20131375 (1970)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"16_CR12","unstructured":"Myhill, J.: Finite automata and the representation of events. Wright Air Development Center Technical Report 57\u2013624 (1957)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Pin, J.E.: Syntactic semigroups. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Word, Language, Grammar, vol.\u00a01, pp. 679\u2013746. Springer (1997)","DOI":"10.1007\/978-3-642-59136-5_10"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/PL00005967","volume":"57","author":"T. Saito","year":"1998","unstructured":"Saito, T.: \n                  \n                    \n                  \n                  ${\\mathcal J}\\\/$\n                -trivial subsemigroups of finite full transformation semigroups. Semigroup Forum\u00a057, 60\u201368 (1998)","journal-title":"Semigroup Forum"},{"key":"16_CR15","unstructured":"Simon, I.: Hierarchies of Events With Dot-Depth One. PhD thesis, Dept. of Applied Analysis & Computer Science, University of Waterloo, Waterloo, Ont., Canada (1972)"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/3-540-07407-4_23","volume-title":"Automata Theory and Formal Languages","author":"I. Simon","year":"1975","unstructured":"Simon, I.: Piecewise testable events. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol.\u00a033, pp. 214\u2013222. Springer, Heidelberg (1975)"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Word, Language, Grammar, vol. 1, pp. 41\u2013110. Springer (1997)","DOI":"10.1007\/978-3-642-59136-5_2"}],"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-642-39310-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T04:25:29Z","timestamp":1548649529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39310-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642393099","9783642393105"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39310-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}