{"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":1771024226367,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642316050","type":"print"},{"value":"9783642316067","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31606-7_28","type":"book-chapter","created":{"date-parts":[[2012,8,25]],"date-time":"2012-08-25T07:47:55Z","timestamp":1345880875000},"page":"321-328","source":"Crossref","is-referenced-by-count":5,"title":["Multi-Tilde-Bar Derivatives"],"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":[{"issue":"4","key":"28_CR1","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1142\/S0129054109006802","volume":"20","author":"M. Almeida","year":"2009","unstructured":"Almeida, M., Moreira, N., Reis, R.: Antimirov and Mosses\u2019s rewrite system revisited. Int. J. Found. Comput. Sci.\u00a020(4), 669\u2013684 (2009)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"28_CR2","doi-asserted-by":"publisher","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. Theoret. Comput. Sci.\u00a0155, 291\u2013319 (1996)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"28_CR3","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0304-3975(95)80024-4","volume":"143","author":"V.M. Antimirov","year":"1995","unstructured":"Antimirov, V.M., Mosses, P.D.: Rewriting extended regular expressions. Theor. Comput. Sci.\u00a0143(1), 51\u201372 (1995)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"28_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(86)90088-5","volume":"48","author":"G. Berry","year":"1986","unstructured":"Berry, G., Sethi, R.: From regular expressions to deterministic automata. Theoret. Comput. Sci.\u00a048(1), 117\u2013126 (1986)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"28_CR5","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"J.A. Brzozowski","year":"1964","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. J. Assoc. Comput. Mach.\u00a011(4), 481\u2013494 (1964)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1\/2","key":"28_CR6","first-page":"71","volume":"15","author":"J.A. Brzozowski","year":"2010","unstructured":"Brzozowski, J.A.: Quotient complexity of regular languages. Journal of Automata, Languages and Combinatorics\u00a015(1\/2), 71\u201389 (2010)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0304-3975(80)90069-9","volume":"10","author":"J.A. Brzozowski","year":"1980","unstructured":"Brzozowski, J.A., Leiss, E.L.: On equations for regular languages, finite automata, and sequential networks. Theor. Comput. Sci.\u00a010, 19\u201335 (1980)","journal-title":"Theor. Comput. Sci."},{"issue":"38-39","key":"28_CR8","doi-asserted-by":"publisher","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.: Erratum to \u201cacyclic automata and small expressions using multi-tilde-bar operators\u201d. [Theoret. Comput. Sci.\u00a0411(38-39), 3423\u20133435] (2010); Theor. Comput. Sci. 412(29), 3795\u20133796 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"28_CR9","first-page":"11","volume":"16","author":"P. Caron","year":"2011","unstructured":"Caron, P., Champarnaud, J.M., Mignot, L.: Multi-bar and multi-tilde regular operators. Journal of Automata, Languages and Combinatorics\u00a016(1), 11\u201326 (2011)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-21254-3_13","volume-title":"Language and Automata Theory and Applications","author":"P. Caron","year":"2011","unstructured":"Caron, P., Champarnaud, J.-M., Mignot, L.: Partial Derivatives of an Extended Regular Expression. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol.\u00a06638, pp. 179\u2013191. Springer, Heidelberg (2011)"},{"key":"28_CR11","unstructured":"Caron, P., Champarnaud, J.M., Mignot, L.: A general frame for the derivation of regular expressions (submitted, 2012)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-28332-1_16","volume-title":"Language and Automata Theory and Applications","author":"J.-M. Champarnaud","year":"2012","unstructured":"Champarnaud, J.-M., Jeanne, H., Mignot, L.: Approximate Regular Expressions and Their Derivatives. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol.\u00a07183, pp. 179\u2013191. Springer, Heidelberg (2012)"},{"issue":"1-2","key":"28_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2009-0001","volume":"90","author":"J.M. Champarnaud","year":"2009","unstructured":"Champarnaud, J.M., Ouardi, F., Ziadi, D.: An efficient computation of the equation $\\mathbb{K}$ -automaton of a regular $\\mathbb{K}$ -expression. Fundam. Inform.\u00a090(1-2), 1\u201316 (2009)","journal-title":"Fundam. Inform."},{"issue":"1","key":"28_CR14","doi-asserted-by":"publisher","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. Theoret. Comput. Sci.\u00a0239(1), 137\u2013163 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR15","unstructured":"Conway, J.H.: Regular algebra and finite machines. Chapman and Hall (1971)"},{"key":"28_CR16","unstructured":"Frishert, M.: FIRE Works & FIRE Station: A finite automata and regular expression playground. Ph.D. thesis, Eindhoven University, Netherlands (2005)"},{"issue":"2","key":"28_CR17","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1145\/321386.321399","volume":"14","author":"A. Ginzburg","year":"1967","unstructured":"Ginzburg, A.: A procedure for checking equality of regular expressions. J. ACM\u00a014(2), 355\u2013362 (1967)","journal-title":"J. ACM"},{"issue":"1","key":"28_CR18","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":"28_CR19","first-page":"3","volume":"34","author":"S. Kleene","year":"1956","unstructured":"Kleene, S.: Representation of events in nerve nets and finite automata. Automata Studies Ann. Math. Studies\u00a034, 3\u201341 (1956)","journal-title":"Automata Studies Ann. Math. Studies"},{"issue":"1","key":"28_CR20","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1142\/S0218196792000062","volume":"2","author":"D. Krob","year":"1992","unstructured":"Krob, D.: Differentation of K-rational expressions. Internat. J. Algebra Comput.\u00a02(1), 57\u201387 (1992)","journal-title":"Internat. J. Algebra Comput."},{"issue":"1-3","key":"28_CR21","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.tcs.2004.10.016","volume":"332","author":"S. Lombardy","year":"2005","unstructured":"Lombardy, S., Sakarovitch, J.: Derivatives of rational expressions with multiplicity. Theor. Comput. Sci.\u00a0332(1-3), 141\u2013177 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"28_CR22","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1017\/S0956796808007090","volume":"19","author":"S. Owens","year":"2009","unstructured":"Owens, S., Reppy, J.H., Turon, A.: Regular-expression derivatives re-examined. J. Funct. Program.\u00a019(2), 173\u2013190 (2009)","journal-title":"J. Funct. Program."},{"key":"28_CR23","unstructured":"Sulzmann, M., Lu, K.: Partial derivative regular expression pattern matching (December 2007) (manuscript)"},{"key":"28_CR24","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)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31606-7_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:40:02Z","timestamp":1620128402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31606-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316050","9783642316067"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31606-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}