{"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":1771024226633,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T00:00:00Z","timestamp":1346457600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s00236-012-0167-x","type":"journal-article","created":{"date-parts":[[2012,8,31]],"date-time":"2012-08-31T04:00:05Z","timestamp":1346385605000},"page":"413-436","source":"Crossref","is-referenced-by-count":5,"title":["Multi-tilde-bar expressions and their automata"],"prefix":"10.1007","volume":"49","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","published-online":{"date-parts":[[2012,9,1]]},"reference":[{"key":"167_CR1","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0304-3975(95)00182-4","volume":"155","author":"V Antimirov","year":"1996","unstructured":"Antimirov, V.: Partial derivatives of regular expressions and finite automaton constructions. Theor. Comput. Sci. 155, 291\u2013319 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"167_CR2","doi-asserted-by":"crossref","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, Lecture Notes in Computer Science, vol. 3153, pp. 876\u2013888. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-28629-5_69"},{"issue":"4","key":"167_CR3","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"JA Brzozowski","year":"1964","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. J. Assoc. Comput. Mach. 11(4), 481\u2013494 (1964)","journal-title":"J. Assoc. Comput. Mach."},{"key":"167_CR4","doi-asserted-by":"crossref","unstructured":"Brzozowski, J.A., McCluskey, E.J.: Signal flow graph techniques for sequential circuit state diagrams. IEEE Trans. Electron. Comput. EC-12(2) (1963)","DOI":"10.1109\/PGEC.1963.263416"},{"key":"167_CR5","doi-asserted-by":"crossref","unstructured":"Caron, P., Champarnaud, J.-M., Mignot L.: Multi-tilde operators and their Glushkov automata. In: Dediu, A.H., Ionescu, A.-M., Mart\u00edn-Vide, C. (eds.) LATA, Lecture Notes in Computer Science, vol. 5457, pp. 290\u2013301. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-00982-2_25"},{"key":"167_CR6","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: Nielsen, M., Kucera, A., Miltersen, P.B., Palamidessi, C., Tuma, P., Valencia, F.D. (eds.) SOFSEM, Lecture Notes in Computer Science, vol. 5404 , pp. 645\u2013655. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-540-95891-8_57"},{"issue":"38\u201339","key":"167_CR7","doi-asserted-by":"crossref","first-page":"3423","DOI":"10.1016\/j.tcs.2010.05.023","volume":"411","author":"P Caron","year":"2010","unstructured":"Caron, P., Champarnaud, J.-M., Mignot, L.: Acyclic automata and small expressions using multi-tilde-bar operators. Theor. Comput. Sci. 411(38\u201339), 3423\u20133435 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"167_CR8","first-page":"103","volume-title":"Mathematics, Computing, Language, and Life: Frontiers in Mathematical Linguistics and Language Theory, Scientific Applications of Language Methods","author":"P Caron","year":"2010","unstructured":"Caron, P., Flouret, M.: On Glushkov $$\\mathbb{K}$$ -graph. In: Martin-Vide, C. (ed.) Mathematics, Computing, Language, and Life: Frontiers in Mathematical Linguistics and Language Theory, Scientific Applications of Language Methods, pp. 103\u2013132. World Scientific, Singapore (2010)"},{"issue":"1\u20132","key":"167_CR9","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 233(1\u20132), 75\u201390 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"167_CR10","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1080\/00207160310001650025","volume":"81","author":"J-M Champarnaud","year":"2004","unstructured":"Champarnaud, J.-M., Coulon, F., Parantho\u00ebn, T.: Compact and fast algorithms for safe regular expression search. Int. J. Comput. Math. 81(4), 383\u2013401 (2004)","journal-title":"Int. J. Comput. Math."},{"key":"167_CR11","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1080\/00207169908804865","volume":"72","author":"J-M Champarnaud","year":"1999","unstructured":"Champarnaud, J.-M., Ponty, J.-L., Ziadi, D.: From regular expressions to finite automata. Int. J. Comput. Math. 72, 415\u2013431 (1999)","journal-title":"Int. J. Comput. Math."},{"issue":"1","key":"167_CR12","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0304-3975(01)00267-5","volume":"239","author":"J-M Champarnaud","year":"2002","unstructured":"Champarnaud, J.-M., Ziadi, D.: Canonical derivatives, partial derivatives, and finite automaton constructions. Theor. Comput. Sci. 239(1), 137\u2013163 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"167_CR13","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/S0022-0000(76)80034-7","volume":"12","author":"A Ehrenfeucht","year":"1976","unstructured":"Ehrenfeucht, A., Zeiger, H.-P.: Complexity measures for regular expressions. J. Comput. Syst. Sci. 12(2), 134\u2013146 (1976)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"167_CR14","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. J. Autom. Lang. Comb. 10(4), 407\u2013437 (2005)","journal-title":"J. Autom. Lang. Comb."},{"key":"167_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1070\/RM1961v016n05ABEH004112","volume":"16","author":"VM Glushkov","year":"1961","unstructured":"Glushkov, V.M.: The abstract theory of automata. Russ. Math. Surv. 16, 1\u201353 (1961)","journal-title":"Russ. Math. Surv."},{"key":"167_CR16","doi-asserted-by":"crossref","unstructured":"Gruber, H., Johannsen, J.: Optimal lower bounds on regular expression size using communication complexity. In: Amadio, R.M. (eds.) FoSSaCS, Lecture Notes in Computer Science, vol. 4962, pp. 273\u2013286. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-78499-9_20"},{"issue":"1","key":"167_CR17","doi-asserted-by":"crossref","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. 186(1), 140\u2013162 (2003)","journal-title":"Inf. Comput."},{"key":"167_CR18","doi-asserted-by":"crossref","unstructured":"Kleene, S.: Representation of events in nerve nets and finite automata. In: Automata Studies, Ann. Math. Studies vol. 34, pp. 3\u201341. Princeton University Press, Princeton (1956)","DOI":"10.1515\/9781400882618-002"},{"key":"167_CR19","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","volume":"9","author":"RF McNaughton","year":"1960","unstructured":"McNaughton, R.F., Yamada, H.: Regular expressions and state graphs for automata. IEEE Trans. Electron. Comput. 9, 39\u201357 (1960)","journal-title":"IEEE Trans. Electron. Comput."},{"key":"167_CR20","unstructured":"Mignot, L.: Des Codes Barres pour les Langages Rationnels. PhD thesis, LITIS, Universit\u00e9 de Rouen, France, 2010. available online, URL: http:\/\/ludovicmignot.free.fr"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-012-0167-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-012-0167-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-012-0167-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T07:52:57Z","timestamp":1562140377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-012-0167-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":20,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["167"],"URL":"https:\/\/doi.org\/10.1007\/s00236-012-0167-x","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9]]}}}