{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:10:25Z","timestamp":1771024225636,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642009815","type":"print"},{"value":"9783642009822","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-642-00982-2_25","type":"book-chapter","created":{"date-parts":[[2009,3,30]],"date-time":"2009-03-30T15:51:54Z","timestamp":1238428314000},"page":"290-301","source":"Crossref","is-referenced-by-count":4,"title":["Multi-tilde Operators and Their Glushkov Automata"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Caron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Marc","family":"Champarnaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ludovic","family":"Mignot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","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"},{"issue":"2","key":"25_CR2","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"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Brzozowski, J.A., McCluskey, E.J.: Signal flow graph techniques for sequential circuit state diagrams. IEEE Trans. on Electronic Computers\u00a0EC-12(2) (1963)","DOI":"10.1109\/PGEC.1963.263416"},{"issue":"4","key":"25_CR4","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"},{"issue":"4","key":"25_CR5","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":"2","key":"25_CR6","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0304-3975(93)90287-4","volume":"120","author":"A. Br\u00fcggemann-Klein","year":"1993","unstructured":"Br\u00fcggemann-Klein, A.: Regular expressions into finite automata. Theoret. Comput. Sci.\u00a0120(2), 197\u2013213 (1993)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"25_CR7","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."},{"issue":"1","key":"25_CR8","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":"25_CR9","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":"1-3","key":"25_CR10","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.tcs.2006.09.025","volume":"370","author":"Y.S. Han","year":"2007","unstructured":"Han, Y.S., Wood, D.: Obtaining shorter regular expressions from finite-state automata. Theor. Comput. Sci.\u00a0370(1-3), 110\u2013120 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"25_CR11","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":"1&2","key":"25_CR12","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."},{"key":"25_CR13","unstructured":"Gelade, W., Neven, F.: Succinctness of the complement and intersection of regular expressions. In: Albers, S., Weil, P. (eds.) STACS. Dagstuhl Seminar Proceedings, vol.\u00a008001, pp. 325\u2013336 (2008)"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-70583-3_4","volume-title":"Automata, Languages and Programming","author":"H. Gruber","year":"2008","unstructured":"Gruber, H., Holzer, M.: Finite automata, digraph connectivity, and regular expression size. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 39\u201350. Springer, Heidelberg (2008)"},{"key":"25_CR15","unstructured":"Gruber, H., Holzer, M.: Language operations with regular expressions of polynomial size. In: C\u00e2mpeanu, C. (ed.) 10th International Workshop on Descriptional Complexity of Formal Systems (DCFS 2008), Charlottetown, Canada, pp. 182\u2013193 (2008)"},{"issue":"1\u20132","key":"25_CR16","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."},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Caron, P., Champarnaud, J.M., Mignot, L.: A new family of regular operators fitting with the position automaton computation. In: et al. (eds.) International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2009), S\u030bpindleruv M\u00fdn, Czech Republic. LNCS (2009)","DOI":"10.1007\/978-3-540-95891-8_57"},{"key":"25_CR18","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)"},{"key":"25_CR19","series-title":"Word, Language, Grammar","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-59136-5_2","volume-title":"Handbook of Formal Languages","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)"},{"key":"25_CR20","volume-title":"Regular algebra and finite machines","author":"J.H. Conway","year":"1971","unstructured":"Conway, J.H.: Regular algebra and finite machines. Chapman and Hall, Boca Raton (1971)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00982-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T06:37:55Z","timestamp":1548398275000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00982-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642009815","9783642009822"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00982-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}