{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:46:19Z","timestamp":1725493579517},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405610"},{"type":"electronic","value":"9783540450894"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45089-0_6","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T03:27:35Z","timestamp":1193455655000},"page":"49-60","source":"Crossref","is-referenced-by-count":1,"title":["From Regular Weighted Expressions to Finite Automata"],"prefix":"10.1007","author":[{"given":"Jean-Marc","family":"Champarnaud","sequence":"first","affiliation":[]},{"given":"\u00c9ric","family":"Laugerotte","sequence":"additional","affiliation":[]},{"given":"Faissal","family":"Ouardi","sequence":"additional","affiliation":[]},{"given":"Djelloul","family":"Ziadi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0304-3975(95)00182-4","volume":"155","author":"V. Antimirov","year":"1996","unstructured":"V. Antimirov, Partial Derivatives of Regular Expressions and Finite Automaton Constructions, Theort. Comput. Sci. 155 (1996), 291\u2013319.","journal-title":"Theort. Comput. Sci."},{"key":"6_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-73235-5","volume-title":"Rational series and their languages","author":"J. Berstel","year":"1988","unstructured":"J. Berstel and C. Reutenauer, Rational series and their languages, Springer-Verlag, Berlin, (1988)."},{"key":"6_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-44674-5_5","volume-title":"Proc. 5th Int. Conf. on Implementations and Applications of Automata (CIAA)","author":"P. Caron","year":"2001","unstructured":"P. Caron and M. Flouret, Glushkov construction for multiplicities, In: S. Yu, A. Paun (eds.), Proc. 5th Int. Conf. on Implementations and Applications of Automata (CIAA). Lecture Notes in Computer Science 2088, Springer-Verlag, (2001), 67\u201379."},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0304-3975(00)00293-0","volume":"267","author":"J.-M. Champarnaud","year":"2001","unstructured":"J.-M. Champarnaud, Subset Construction Complexity for Homogeneous Automata, Position Automata and ZPC-Structures, Theoret. Comp. Sc., 267(2001), 17\u201334.","journal-title":"Theoret. Comp. Sc."},{"key":"6_CR5","unstructured":"J.-M. Champarnaud and D. Ziadi, Computing the Equation Automaton of Regular Expression in O(s\n                           2) space and time, in CPM 2001, Combinatorial Pattern Matching, Lecture Notes in Computer Science, A. Amir and G.M. Landau eds., Springer-Verlag, 2089 (2001), 157\u2013168."},{"key":"6_CR6","first-page":"1","volume":"16","author":"V.-M. Glushkov","year":"1961","unstructured":"V.-M. Glushkov, The abstract theory of automata, Russian Mathematical Surveys, 16 (1961), 1\u201353.","journal-title":"The abstract theory of automata"},{"key":"6_CR7","volume-title":"Semirings-algebraic theory and applications in computer science","author":"U. Hebisch","year":"1993","unstructured":"U. Hebisch and H. J. Weinert, Semirings-algebraic theory and applications in computer science, World Scientific, Singapore, (1993)."},{"key":"6_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69959-7","volume-title":"Semirings, automata, languages","author":"W. Kuich","year":"1986","unstructured":"W. Kuich and J. Salomaa, Semirings, automata, languages. Springer-Verlag, Berlin, (1986)."},{"key":"6_CR9","unstructured":"S. Lombardy and J. Sakarovitch, Derivatives of regular expression with multiplicity, Research report of ENST, 2001D001, (2001)."},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","volume":"9","author":"R. F. McNaughton","year":"1960","unstructured":"R. F. McNaughton and H. Yamada, Regular expressions and state graphs for automata, IEEE Tans. Electronic Comput. 9 (1960), 39\u201347.","journal-title":"IEEE Tans. Electronic Comput."},{"key":"6_CR11","first-page":"245","volume":"6","author":"M. P. Sch\u00fctzenberger","year":"1961","unstructured":"M. P. Sch\u00fctzenberger, On the definition of a family of automata. Information and control 6 (1961), 245\u2013270.","journal-title":"On the definition of a family of automata"},{"key":"6_CR12","first-page":"177","volume":"4","author":"D. Ziadi","year":"1997","unstructured":"D. Ziadi, J.-L. Ponty, J.-M. Champarnaud, Passage d\u2019une expression rationnelle \u00e0 un automate fini non-d\u00e9terministe, Bull. Bel. Math. Soc., 4 (1997), 177\u2013203.","journal-title":"Bull. Bel. Math. Soc."},{"key":"6_CR13","unstructured":"D. Ziadi, Quelques Aspects Th\u00e9oriques et Algorithmiques des Automates, Th\u00e8se d\u2019habilitation \u00e0 diriger des recherches. Universit\u00e9 de Rouen, (2002)."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45089-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T11:08:37Z","timestamp":1551006517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45089-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405610","9783540450894"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45089-0_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}