{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:59:28Z","timestamp":1725796768061},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319097039"},{"type":"electronic","value":"9783319097046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09704-6_19","type":"book-chapter","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T05:43:21Z","timestamp":1405057401000},"page":"210-221","source":"Crossref","is-referenced-by-count":1,"title":["Prefix-Free Languages: Right Quotient and Reversal"],"prefix":"10.1007","author":[{"given":"Jozef","family":"Jir\u00e1sek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Galina","family":"Jir\u00e1skov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monika","family":"Krausov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Mlyn\u00e1r\u010dik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juraj","family":"\u0160ebej","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"MRI Symposia Series","first-page":"529","volume-title":"Proceedings of the Symposium on Mathematical Theory of Automata","author":"J.A. Brzozowski","year":"1963","unstructured":"Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. In: Fox, J. (ed.) Proceedings of the Symposium on Mathematical Theory of Automata, New York, NY, April 24-26. MRI Symposia Series, vol.\u00a012, pp. 529\u2013561. Polytechnic Press of the Polytechnic Institute of Brooklyn, Brooklyn (1963)"},{"unstructured":"Champarnaud, J.-M., Khorsi, A., Parantho\u00ebn, T.: Split and join for minimizing: Brzozowski\u2019s algorithm, http:\/\/jmc.feydakins.org\/ps\/c09psc02.ps","key":"19_CR2"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-25929-6_9","volume-title":"Mathematical and Engineering Methods in Computer Science","author":"R. Cmorik","year":"2012","unstructured":"Cmorik, R., Jir\u00e1skov\u00e1, G.: Basic operations on binary suffix-free languages. In: Kot\u00e1sek, Z., Bouda, J., \u010cern\u00e1, I., Sekanina, L., Vojnar, T., Anto\u0161, D. (eds.) MEMICS 2011. LNCS, vol.\u00a07119, pp. 94\u2013102. Springer, Heidelberg (2012)"},{"unstructured":"Han, Y.-S., Salomaa, K., Wood, D.: Operational state complexity of prefix-free regular languages. In: Automata, Formal Languages, and Related Topics, pp. 99\u2013115. Institute of Informatics, University of Szeged (2009)","key":"19_CR4"},{"key":"19_CR5","doi-asserted-by":"crossref","first-page":"93","DOI":"10.3233\/FI-2009-0008","volume":"90","author":"Y.-S. Han","year":"2009","unstructured":"Han, Y.-S., Salomaa, K., Wood, D.: Nondeterministic state complexity of basic operations for prefix-free regular languages. Fund. Inform.\u00a090, 93\u2013106 (2009)","journal-title":"Fund. Inform."},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-642-00982-2_34","volume-title":"Language and Automata Theory and Applications","author":"Y.-S. Han","year":"2009","unstructured":"Han, Y.-S., Salomaa, K., Yu, S.: State complexity of combined operations for prefix-free regular languages. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol.\u00a05457, pp. 398\u2013409. Springer, Heidelberg (2009)"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-642-38536-0_22","volume-title":"Computer Science \u2013 Theory and Applications","author":"J. Jir\u00e1sek","year":"2013","unstructured":"Jir\u00e1sek, J., Jir\u00e1skov\u00e1, G.: Cyclic shift on prefix-free languages. In: Bulatov, A.A., Shur, A.M. (eds.) CSR 2013. LNCS, vol.\u00a07913, pp. 246\u2013257. Springer, Heidelberg (2013)"},{"unstructured":"Jir\u00e1skov\u00e1, G., Krausov\u00e1, M.: Complexity in prefix-free regular languages. In: McQuillan, I., Pighizzini, G., Trost, B. (eds.) Proc. 12th DCFS, pp. 236\u2013244.","key":"19_CR8"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2012.05.008","volume":"449","author":"G. Jir\u00e1skov\u00e1","year":"2012","unstructured":"Jir\u00e1skov\u00e1, G., \u0160ebej, J.: Reversal of binary regular languages. Theoret. Comput. Sci.\u00a0449, 85\u201392 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-25929-6_11","volume-title":"Mathematical and Engineering Methods in Computer Science","author":"M. Krausov\u00e1","year":"2012","unstructured":"Krausov\u00e1, M.: Prefix-free regular languages: Closure properties, difference, and left quotient. In: Kot\u00e1sek, Z., Bouda, J., \u010cern\u00e1, I., Sekanina, L., Vojnar, T., Anto\u0161, D. (eds.) MEMICS 2011. LNCS, vol.\u00a07119, pp. 114\u2013122. Springer, Heidelberg (2012)"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(81)80005-9","volume":"13","author":"E. Leiss","year":"1981","unstructured":"Leiss, E.: Succinct representation of regular languages by Boolean automata. Theoret. Comput. Sci.\u00a013, 323\u2013330 (1981)","journal-title":"Theoret. Comput. Sci."},{"unstructured":"Lupanov, U.I.: A comparison of two types of finite automata. Problemy Kibernetiki\u00a09, 321\u2013326 (1963) (in Russian)","key":"19_CR12"},{"unstructured":"Mirkin, B.G.: On dual automata. Kibernetika (Kiev)\u00a02, 7-10 (1966) (in Russian)","key":"#cr-split#-19_CR13.1"},{"unstructured":"English translation: Cybernetics 2, 6-9 (1966)","key":"#cr-split#-19_CR13.2"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M. Rabin","year":"1959","unstructured":"Rabin, M., Scott, D.: Finite automata and their decision problems. IBM Res. Develop.\u00a03, 114\u2013129 (1959)","journal-title":"IBM Res. Develop."},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.tcs.2004.02.032","volume":"320","author":"A. Salomaa","year":"2004","unstructured":"Salomaa, A., Wood, D., Yu, S.: On the state complexity of reversals of regular languages. Theoret. Comput. Sci.\u00a0320, 315\u2013329 (2004)","journal-title":"Theoret. Comput. Sci."},{"unstructured":"\u0160ebej, J.: Reversal of regular languages and state complexity. In: Pardubsk\u00e1, D. (ed.) Proc. 10th ITAT, pp. 47\u201354. \u0160af\u00e1rik University, Ko\u0161ice (2010)","key":"19_CR16"},{"key":"19_CR17","volume-title":"Introduction to the theory of computation","author":"M. Sipser","year":"1997","unstructured":"Sipser, M.: Introduction to the theory of computation. PWS Publishing Company, Boston (1997)"},{"doi-asserted-by":"crossref","unstructured":"Yan, S.Y.: Number theory for computing, 2nd edn. Springer (2002)","key":"19_CR18","DOI":"10.1007\/978-3-662-04773-6"},{"doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a0I, ch. 2, pp. 41\u2013110. Springer, Heidelberg (1997)","key":"19_CR19","DOI":"10.1007\/978-3-642-59136-5_2"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(92)00011-F","volume":"125","author":"S. Yu","year":"1994","unstructured":"Yu, S., Zhuang, Q., Salomaa, K.: The state complexity of some basic operations on regular languages. Theoret. Comput. Sci.\u00a0125, 315\u2013328 (1994)","journal-title":"Theoret. Comput. Sci."}],"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-09704-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,22]],"date-time":"2020-08-22T02:00:09Z","timestamp":1598061609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09704-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319097039","9783319097046"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09704-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}