{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T10:58:43Z","timestamp":1780743523655,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540369257","type":"print"},{"value":"9783540369264","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_11","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T09:41:33Z","timestamp":1155634893000},"page":"83-93","source":"Crossref","is-referenced-by-count":3,"title":["Varieties Generated by Certain Models of Reversible Finite Automata"],"prefix":"10.1007","author":[{"given":"Marats","family":"Golovkins","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Eric","family":"Pin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"11_CR1","volume-title":"Finite Semigroups and Universal Algebra","author":"J. Almeida","year":"1994","unstructured":"Almeida, J.: Finite Semigroups and Universal Algebra. World Scientific, Singapore (1994)"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1017\/S0305004100075332","volume":"111","author":"J. Almeida","year":"1992","unstructured":"Almeida, J., Pin, J.E., Weil, P.: Semigroups whose Idempotents Form a Subsemigroup. Math. Proc. Camb. Phil. Soc.\u00a0111, 241\u2013253 (1992)","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-540-24749-4_9","volume-title":"STACS 2004","author":"A. Ambainis","year":"2004","unstructured":"Ambainis, A., Beaudry, M., Golovkins, M., \u0136ikusts, A., Mercer, M., Th\u00e9rien, D.: Algebraic Results on Quantum Automata. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 93\u2013104. Springer, Heidelberg (2004)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-48686-0_17","volume-title":"Computing and Combinatorics","author":"A. Ambainis","year":"1999","unstructured":"Ambainis, A., Bonner, R.F., Freivalds, R., \u0136ikusts, A.: Probabilities to Accept Languages by Quantum Finite Automata. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol.\u00a01627, pp. 174\u2013183. Springer, Heidelberg (1999)"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Freivalds, R.: 1-Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations. In: Proc. 39th FOCS, pp. 332\u2013341 (1998)","DOI":"10.1109\/SFCS.1998.743469"},{"issue":"4","key":"11_CR6","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1145\/581771.581773","volume":"49","author":"A. Ambainis","year":"2002","unstructured":"Ambainis, A., Nayak, A., Ta-Shma, A., Vazirani, U.: Dense Quantum Coding and Quantum Finite Automata. Journal of the ACM\u00a049(4), 496\u2013511 (2002)","journal-title":"Journal of the ACM"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1017\/S1446788700028998","volume":"43","author":"C.J. Ash","year":"1987","unstructured":"Ash, C.J.: Finite Semigroups with Commuting Idempotents. J. Austral. Math. Soc. (Series A)\u00a043, 81\u201390 (1987)","journal-title":"J. Austral. Math. Soc. (Series A)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45007-6_1","volume-title":"Developments in Language Theory","author":"A. Bertoni","year":"2003","unstructured":"Bertoni, A., Mereghetti, C., Palano, B.: Quantum Computing: 1-Way Quantum Finite Automata. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 1\u201320. Springer, Heidelberg (2003)"},{"issue":"5","key":"11_CR9","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1137\/S0097539799353443","volume":"31","author":"A. Brodsky","year":"2002","unstructured":"Brodsky, A., Pippenger, N.: Characterizations of 1-Way Quantum Finite Automata. SIAM Journal on Computing\u00a031(5), 1456\u20131478 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/3-540-45655-4_61","volume-title":"Computing and Combinatorics","author":"M. Golovkins","year":"2002","unstructured":"Golovkins, M., Kravtsev, M.: Probabilistic Reversible Automata and Quantum Automata. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, pp. 574\u2013583. Springer, Heidelberg (2002)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Kondacs, A., Watrous, J.: On The Power of Quantum Finite State Automata. In: Proc. 38th FOCS, pp. 66\u201375 (1997)","DOI":"10.1109\/SFCS.1997.646094"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/0021-8693(87)90048-2","volume":"110","author":"S.W. Margolis","year":"1987","unstructured":"Margolis, S.W., Pin, J.E.: Inverse Semigroups and Varieties of Finite Semigroups. Journal of Algebra\u00a0110, 306\u2013323 (1987)","journal-title":"Journal of Algebra"},{"issue":"1-2","key":"11_CR13","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0304-3975(98)00191-1","volume":"237","author":"C. Moore","year":"2000","unstructured":"Moore, C., Crutchfield, J.P.: Quantum Automata and Quantum Grammars. Theoretical Computer Science\u00a0237(1-2), 275\u2013306 (2000)","journal-title":"Theoretical Computer Science"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Nayak, A.: Optimal Lower Bounds for Quantum Automata and Random Access Codes. In: Proc. 40th FOCS, pp. 369\u2013377 (1999)","DOI":"10.1109\/SFFCS.1999.814608"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Pin, J.E.: Varieties of Formal Langages. North Oxford, London and Plenum, New York (1986)","DOI":"10.1007\/978-1-4613-2215-3"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/3-540-18088-5_19","volume-title":"Automata, Languages and Programming","author":"J.E. Pin","year":"1987","unstructured":"Pin, J.E.: On the Languages Accepted by Finite Reversible Automata. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol.\u00a0267, pp. 237\u2013249. Springer, Heidelberg (1987)"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BFb0023844","volume-title":"LATIN \u201992","author":"J.E. Pin","year":"1992","unstructured":"Pin, J.E.: On Reversible Automata. In: Simon, I. (ed.) LATIN 1992. LNCS, vol.\u00a0583, pp. 401\u2013416. Springer, Heidelberg (1992)"},{"issue":"1","key":"11_CR18","first-page":"80","volume":"39","author":"J.E. Pin","year":"1995","unstructured":"Pin, J.E.: Eilenberg\u2019s Theorem for Positive Varieties of Languages. Russian Mathematics (Iz. VUZ)\u00a039(1), 80\u201390 (1995)","journal-title":"Russian Mathematics (Iz. VUZ)"},{"issue":"1","key":"11_CR19","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1081\/AGB-120006484","volume":"30","author":"J.E. Pin","year":"2002","unstructured":"Pin, J.E., Weil, P.: Semidirect Products of Ordered Semigroups. Communications in Algebra\u00a030(1), 149\u2013169 (2002)","journal-title":"Communications in Algebra"},{"issue":"12","key":"11_CR20","doi-asserted-by":"publisher","first-page":"5677","DOI":"10.1081\/AGB-120016005","volume":"30","author":"J.E. Pin","year":"2002","unstructured":"Pin, J.E., Weil, P.: The Wreath Product Principle for Ordered Semigroups. Communications in Algebra\u00a030(12), 5677\u20135713 (2002)","journal-title":"Communications in Algebra"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/3-540-44683-4_53","volume-title":"Mathematical Foundations of Computer Science 2001","author":"L. Pol\u00e1k","year":"2001","unstructured":"Pol\u00e1k, L.: Syntactic Semiring of a Language. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 611\u2013620. Springer, Heidelberg (2001)"},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1112\/jlms\/s1-29.4.404","volume":"29","author":"G.B. Preston","year":"1954","unstructured":"Preston, G.B.: Inverse Semi-groups with Minimal Right Ideals. J. London Math. Soc.\u00a029, 404\u2013411 (1954)","journal-title":"J. London Math. Soc."},{"issue":"6","key":"11_CR23","first-page":"1119","volume":"84","author":"V.V. Vagner","year":"1952","unstructured":"Vagner, V.V.: Generalized Groups. Dokl. Akad. Nauk SSSR\u00a084(6), 1119\u20131122 (1952)","journal-title":"Dokl. Akad. Nauk SSSR"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:26:31Z","timestamp":1619493991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11809678_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}