{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:10:26Z","timestamp":1771024226086,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540958901","type":"print"},{"value":"9783540958918","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-540-95891-8_57","type":"book-chapter","created":{"date-parts":[[2009,1,22]],"date-time":"2009-01-22T01:19:21Z","timestamp":1232587161000},"page":"645-655","source":"Crossref","is-referenced-by-count":4,"title":["A New Family of Regular Operators Fitting with the Position Automaton Computation"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Caron","sequence":"first","affiliation":[]},{"given":"Jean-Marc","family":"Champarnaud","sequence":"additional","affiliation":[]},{"given":"Ludovic","family":"Mignot","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"57_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1007\/978-3-540-28629-5_69","volume-title":"Mathematical Foundations of Computer Science 2004","author":"B. Bouchou","year":"2004","unstructured":"Bouchou, B., Duarte, D., Halfeld Ferrari, M., Laurent, D., Musicante, M.-A.: Schema evolution for xml: A consistency-preserving approach. In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol.\u00a03153, pp. 876\u2013888. Springer, Heidelberg (2004)"},{"issue":"1\u20132","key":"57_CR2","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0304-3975(97)00296-X","volume":"233","author":"P. Caron","year":"2000","unstructured":"Caron, P., Ziadi, D.: Characterization of Glushkov automata. Theoret. Comput. Sci.\u00a0233(1\u20132), 75\u201390 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"57_CR3","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1142\/S0218196701000772","volume":"11","author":"J.-M. Champarnaud","year":"2001","unstructured":"Champarnaud, J.-M., Ziadi, D.: From c-continuations to new quadratic algorithms for automata synthesis. Internat. J. Algebra Comput.\u00a011(6), 707\u2013735 (2001)","journal-title":"Internat. J. Algebra Comput."},{"key":"57_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-540-30500-2_31","volume-title":"Implementation and Application of Automata","author":"M. Delgado","year":"2005","unstructured":"Delgado, M., Morais, J.: Approximation to the smallest regular expression for a given regular language. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol.\u00a03317, pp. 312\u2013314. Springer, Heidelberg (2005)"},{"issue":"4","key":"57_CR5","first-page":"407","volume":"10","author":"K. Ellul","year":"2005","unstructured":"Ellul, K., Krawetz, B., Shallit, J., Wang, M.: Regular expressions: New results and open problems. Journal of Automata, Languages and Combinatorics\u00a010(4), 407\u2013437 (2005)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"2","key":"57_CR6","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02531491","volume":"12","author":"V.M. Glushkov","year":"1960","unstructured":"Glushkov, V.M.: On a synthesis algorithm for abstract automata. Ukr. Matem. Zhurnal\u00a012(2), 147\u2013156 (1960) (in Russian)","journal-title":"Ukr. Matem. Zhurnal"},{"issue":"4","key":"57_CR7","first-page":"257","volume":"34","author":"C. Hagenah","year":"2000","unstructured":"Hagenah, C., Muscholl, A.: Computing epsilon-free nfa from regular expressions in o(n log\n                    \n                      \n                    \n                    $^{\\mbox{2}}$\n                  (n)) time. ITA\u00a034(4), 257\u2013278 (2000)","journal-title":"ITA"},{"key":"57_CR8","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"issue":"4","key":"57_CR9","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1006\/jcss.2001.1748","volume":"62","author":"J. Hromkovic","year":"2001","unstructured":"Hromkovic, J., Seibert, S., Wilke, T.: Translating regular expressions into small \u03b5-free nondeterministic finite automata. J. Comput. Syst. Sci.\u00a062(4), 565\u2013588 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"57_CR10","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/S0890-5401(03)00090-7","volume":"186","author":"L. Ilie","year":"2003","unstructured":"Ilie, L., Yu, S.: Follow automata. Inf. Comput.\u00a0186(1), 140\u2013162 (2003)","journal-title":"Inf. Comput."},{"key":"57_CR11","first-page":"3","volume":"34","author":"S. Kleene","year":"1956","unstructured":"Kleene, S.: Representation of events in nerve nets and finite automata. Automata Studies\u00a034, 3\u201341 (1956)","journal-title":"Automata Studies"},{"key":"57_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","volume":"9","author":"R.F. McNaughton","year":"1960","unstructured":"McNaughton, R.F., Yamada, H.: Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers\u00a09, 39\u201357 (1960)","journal-title":"IEEE Transactions on Electronic Computers"},{"key":"57_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/11605157_2","volume-title":"Implementation and Application of Automata","author":"J. Sakarovitch","year":"2006","unstructured":"Sakarovitch, J.: The language, the expression, and the (small) automaton. In: Farr\u00e9, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol.\u00a03845, pp. 15\u201330. Springer, Heidelberg (2006)"},{"key":"57_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-59136-5_2","volume-title":"Handbook of Formal Languages, Word, Language, Grammar","author":"S. Yu","year":"1997","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Word, Language, Grammar, vol.\u00a0I, pp. 41\u2013110. Springer, Berlin (1997)"},{"issue":"1&2","key":"57_CR15","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0304-3975(96)00028-X","volume":"163","author":"D. Ziadi","year":"1996","unstructured":"Ziadi, D.: Regular expression for a language without empty word. Theor. Comput. Sci\u00a0163(1&2), 309\u2013315 (1996)","journal-title":"Theor. Comput. Sci"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2009: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-95891-8_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T21:00:58Z","timestamp":1551733258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-95891-8_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540958901","9783540958918"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-95891-8_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}