{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:45Z","timestamp":1761611205752},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679011"},{"type":"electronic","value":"9783540446125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44612-5_65","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T09:28:20Z","timestamp":1178357300000},"page":"699-708","source":"Crossref","is-referenced-by-count":12,"title":["An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions"],"prefix":"10.1007","author":[{"given":"Hiroaki","family":"Yamamoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"65_CR1","doi-asserted-by":"crossref","unstructured":"A.V. Aho, Algorithms for finding patterns in strings, In J.V. Leeuwen, ed. Handbook of theoretical computer science, Elsevier Science Pub., 1990.","DOI":"10.1016\/B978-0-444-88071-0.50010-2"},{"key":"65_CR2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A.K. Chandra","year":"1981","unstructured":"A.K. Chandra, D.C. Kozen and L.J. Stockmeyer, Alternation, J. Assoc. Comput. Mach. 28, 1, 114\u2013133, 1981.","journal-title":"Alternation, J. Assoc. Comput. Mach."},{"key":"65_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(96)00140-5","volume":"178","author":"C.H. Chang","year":"1997","unstructured":"C.H. Chang, and R. Paige, From regular expressions to DFA\u2019s using compressed NFA\u2019s, Theoret. Comput. Sci., 178, 1\u201336, 1997.","journal-title":"Theoret. Comput. Sci"},{"issue":"1-2","key":"65_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01188587","volume":"13","author":"J.R. Knight","year":"1995","unstructured":"J.R. Knight and E.W. Myers, Super-Pattern matching, Algorithmica, 13, 1-2, 211\u2013243, 1995.","journal-title":"Algorithmica"},{"key":"65_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-51486-4_67","volume-title":"14th MFCS\u201989","author":"J. Dassow","year":"1989","unstructured":"J. Dassow, J. Hromkovic, J. Karhuaki, B. Rovan and A. Slobodova, On the power of synchronization in parallel computation, In Proc. 14th MFCS\u201989, LNCS 379, 196\u2013206, 1989."},{"key":"65_CR6","volume-title":"Introduction to automata theory language and computation","author":"J.E. Hopcroft","year":"1979","unstructured":"J.E. Hopcroft and J.D. Ullman, Introduction to automata theory language and computation, Addison Wesley, Reading Mass, 1979."},{"key":"65_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1142\/S0129054192000073","volume":"3","author":"J. Hromkovic","year":"1992","unstructured":"J. Hromkovic, K. Inoue, B. Rovan, A. Slobodova, I. Takanami and K.W. Wagner, On the power of one-way synchronized alternating machines with small space, International Journal of Foundations of Computer Science, 3, 1, 65\u201379, 1992.","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"4","key":"65_CR8","first-page":"430","volume":"39","author":"G. Myers","year":"1992","unstructured":"G. Myers, A four Russians algorithm for regular expression pattern matching, J. Assoc. Comput. Mach. 39, 4, 430\u201348, 1992.","journal-title":"J. Assoc. Comput. Mach."},{"key":"65_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1007\/BFb0017175","volume-title":"13th MFCS\u201988","author":"A. Slobodova","year":"1988","unstructured":"A. Slobodova, On the power of communication in alternating machines, In Proc. 13th MFCS\u201988, LNCS 324, 518\u2013528, 1988."},{"key":"65_CR10","series-title":"Lect Notes Comput Sci","volume-title":"Proc. COCOON\u20192000","author":"H. Yamamoto","year":"2000","unstructured":"H. Yamamoto, On the power of input-synchronized alternating finite automata, Proc. COCOON\u20192000, LNCS, to appear."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44612-5_65","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T09:40:12Z","timestamp":1550310012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44612-5_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679011","9783540446125"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44612-5_65","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}