{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:28:45Z","timestamp":1743031725132,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029783"},{"type":"electronic","value":"9783642029790"}],"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-02979-0_6","type":"book-chapter","created":{"date-parts":[[2009,7,6]],"date-time":"2009-07-06T08:16:20Z","timestamp":1246868180000},"page":"24-33","source":"Crossref","is-referenced-by-count":8,"title":["Compact Normal Form for Regular Languages as Xor Automata"],"prefix":"10.1007","author":[{"given":"Jean","family":"Vuillemin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Gama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"EATCS Monograph","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-73235-5","volume-title":"Rational Series and Their Languages","author":"J. Berstel","year":"1988","unstructured":"Berstel, J., Reutenauer, C.: Rational Series and Their Languages. EATCS Monograph. Springer, Heidelberg (1988)"},{"key":"6_CR2","series-title":"MRI Symposia Series","first-page":"529","volume-title":"Mathematical theory of Automata","author":"J.A. Brzozowski","year":"1962","unstructured":"Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. In: Mathematical theory of Automata. MRI Symposia Series, vol.\u00a012, pp. 529\u2013561. Polytechnic Press, Polytechnic Institute of Brooklyn (1962)"},{"key":"6_CR3","first-page":"469","volume":"7","author":"M. Domaratzki","year":"2002","unstructured":"Domaratzki, M., Kisman, D., Shallit, J.: On the number of distinct languages accepted by finite automata with n states. Journal of Automata, Languages and Combinatorics\u00a07, 469\u2013486 (2002)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"6_CR4","first-page":"197","volume":"53","author":"M. Fliess","year":"1974","unstructured":"Fliess, M.: Matrices de Hankel. J. Math pures et appl.\u00a053, 197\u2013224 (1974)","journal-title":"J. Math pures et appl."},{"key":"6_CR5","first-page":"69","volume":"20","author":"D.A. Huffman","year":"1955","unstructured":"Huffman, D.A.: The synthesis of sequential switching circuits. The journal of symbolic logic\u00a020, 69\u201370 (1955)","journal-title":"The journal of symbolic logic"},{"issue":"6","key":"6_CR6","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1137\/0222067","volume":"22","author":"T. Jiang","year":"1993","unstructured":"Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM Journal on Computing\u00a022(6), 1117\u20131141 (1993)","journal-title":"SIAM Journal on Computing"},{"issue":"7","key":"6_CR7","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1109\/T-C.1970.222994","volume":"19","author":"T. Kameda","year":"1970","unstructured":"Kameda, T., Weiner, P.: On the state minimalization of nondeterministic finite. Automata. IEEE Transactions on Computers\u00a019(7), 617\u2013627 (1970)","journal-title":"IEEE Transactions on Computers"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"J. Massey","year":"1969","unstructured":"Massey, J.: Shift register synthesis and BCH decoding. Trans. on Information Theory\u00a0IT-15, 122\u2013127 (1969)","journal-title":"Trans. on Information Theory"},{"key":"6_CR9","volume-title":"Handbook of weighted automata","author":"M. Mohri","year":"2009","unstructured":"Mohri, M.: Weighted automata algorithms. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of weighted automata. Springer, Heidelberg (2009)"},{"key":"6_CR10","first-page":"60","volume":"23","author":"E.F. Moore","year":"1958","unstructured":"Moore, E.F.: Gedanken-experiments on sequential machines. The Journal of Symbolic Logic\u00a023, 60 (1958)","journal-title":"The Journal of Symbolic Logic"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"A. Nerode","year":"1958","unstructured":"Nerode, A.: Linear automaton transformations. Proceedings of the AMS\u00a09, 541\u2013544 (1958)","journal-title":"Proceedings of the AMS"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M.O. Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM Journal\u00a03, 114\u2013125 (1959)","journal-title":"IBM Journal"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"M.P. Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M.P.: On the definition of a family of automata. Information and Control\u00a04, 245\u2013270 (1961)","journal-title":"Information and Control"},{"issue":"1-2","key":"6_CR14","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.tcs.2004.07.012","volume":"328","author":"L. Zijl van","year":"2004","unstructured":"van Zijl, L.: On binary xor-NFAs and succinct descriptions of regular languages. Theoretical Computer Science\u00a0328(1-2), 161\u2013170 (2004)","journal-title":"Theoretical Computer Science"},{"key":"6_CR15","first-page":"125","volume-title":"Proc. of SAICSIT","author":"L. Zijl van","year":"2004","unstructured":"van Zijl, L., Muller, G.: Minimization of unary symmetric difference NFAs. In: Proc. of SAICSIT, pp. 125\u2013134. ACM, New York (2004)"},{"key":"6_CR16","unstructured":"Watson, B.W.: A taxonomy of finite automata minimization algorithmes. Computing Science Note 93\/44, Eindhoven University of Technology, The Netherlands (1993)"},{"key":"6_CR17","unstructured":"Watson, B.W.: Combining two algorithms by Brzozowski. In: Wood, D., Yu, S. (eds.) Proceedings of the Fifth International Conference on Implementing Automata, London, Canada (July 2001)"}],"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-02979-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,4]],"date-time":"2018-10-04T19:33:36Z","timestamp":1538681616000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02979-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029783","9783642029790"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02979-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}