{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T22:43:03Z","timestamp":1694558583985},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1986,3,1]],"date-time":"1986-03-01T00:00:00Z","timestamp":510019200000},"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":[[1986,3]]},"DOI":"10.1007\/bf00263650","type":"journal-article","created":{"date-parts":[[2004,10,1]],"date-time":"2004-10-01T07:21:28Z","timestamp":1096615288000},"page":"663-678","source":"Crossref","is-referenced-by-count":17,"title":["Minimal coverings for incompletely specified sequential machines"],"prefix":"10.1007","volume":"22","author":[{"given":"B.","family":"Reusch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.","family":"Merzenich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","first-page":"156","volume":"3","author":"J.C. Beatty","year":"1964","unstructured":"Beatty, J.C., Miller, R.E.: Some Theorems for Incompletely Specified Sequential Machines with Applications to State Minimization. Proc. 3rd SWAT 3, 156?164 (1964)","journal-title":"Proc. 3rd SWAT"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1109\/T-C.1971.223221","volume":"20","author":"R.G. Bennetts","year":"1971","unstructured":"Bennetts, R.G.: An Improved Method of Prime C-Class Derivation in the State Reduction of Sequential Networks. IEEE Trans. Comput. 20, 229?231 (1971)","journal-title":"IEEE Trans. Comput."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1049\/ree.1972.0088","volume":"42","author":"R.G. Bennetts","year":"1972","unstructured":"Bennetts, R.G., Washington, J.L., Lewin, D.W.: A Computer Algorithm for State Table Reductions. IERE Radio Electron. Eng. 42, 513?520 (1972)","journal-title":"IERE Radio Electron. Eng."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1109\/T-C.1974.223780","volume":"23","author":"N.N. Biswas","year":"1974","unstructured":"Biswas, N.N.: State Minimization of Incompletely Specified Sequential Machines. IEEE Trans. Comput. 23, 80?84 (1974)","journal-title":"IEEE Trans. Comput."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1109\/TC.1968.229126","volume":"17","author":"A. Bouchet","year":"1968","unstructured":"Bouchet, A.: An Algebraic Method for Minimizing the Number of States in Incomplete Sequential Machines. IEEE Trans. Electron. Comput. 17, 795?798 (1968)","journal-title":"IEEE Trans. Electron. Comput."},{"key":"CR6","first-page":"665","volume":"18","author":"A.K. Choudhury","year":"1969","unstructured":"Choudhury, A.K., Basu, A.K., de Sarkar, S.C.: On the Determination of the Maximum Compatibility Classes. IEEE Trans. Comput. 18, 665 (1969)","journal-title":"IEEE Trans. Comput."},{"key":"CR7","unstructured":"Davio, M.: Algebraic Research of the Maximal Compatibility Classes for Incompletely Specified Sequential Machines. M.B.L.E. Brussels, Rep. R 118 (1969)"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1109\/PROC.1969.7028","volume":"57","author":"S.R. Das","year":"1969","unstructured":"Das, S.R., Sheng, C.L.: On Finding Maximum Compatibles. Proc. IEEE 57, 694?695 (1969)","journal-title":"Proc. IEEE"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1109\/T-C.1969.222552","volume":"18","author":"S.C. Sarkar De","year":"1969","unstructured":"De Sarkar, S.C., Basu, A.K., Choudhury, A.K.: Simplification of Incompletely Specified Flow Tables with the Help of Prime Closed Sets. IEEE Trans. Comput. 18, 953?956 (1969)","journal-title":"IEEE Trans. Comput."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1109\/T-C.1971.223375","volume":"20","author":"S.C. Sarkar De","year":"1971","unstructured":"De Sarkar, S.C., Basu, A.K., Choudhury, A.K.: On the Determination of Irredundant Prime Closed Sets. IEEE Trans. Comput. 20, 933?938 (1971)","journal-title":"IEEE Trans. Comput."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1109\/TC.1979.1675400","volume":"28","author":"A. Dunworth","year":"1979","unstructured":"Dunworth, A., Hartog, H.V.: An Efficient State Minimization Algorithm for Some Special Classes of Incompletely Specified Sequential Machines. IEEE Trans. Comput. 28, 531?535 (1979)","journal-title":"IEEE Trans. Comput."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/T-C.1972.223549","volume":"21","author":"H.D. Ehrich","year":"1972","unstructured":"Ehrich, H.D.: A Note on State Minimization of a Special Class of Incomplete Sequential Machines. IEEE Trans. Comput. 21, 500?502 (1972)","journal-title":"IEEE Trans. Comput."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1109\/TEC.1959.5222056","volume":"8","author":"S. Ginsburg","year":"1959","unstructured":"Ginsburg, S.: Synthesis of Minimal State Machines. IEEE Trans. Electron. Comput. 8, 441?449 (1959)","journal-title":"IEEE Trans. Electron. Comput."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1145\/320964.320983","volume":"6","author":"S. Ginsburg","year":"1959","unstructured":"Ginsburg, S.: On the Reduction of Superfluous States in a Sequential Machine. J. Assoc. Comput. Mach. 6, 252?282 (1959)","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1109\/TEC.1959.5222696","volume":"8","author":"S. Ginsburg","year":"1959","unstructured":"Ginsburg, S.: A Technique for the Reduction of a Given Machine to a Minimal State Machine. IEEE Trans. Electron. Comput. 8, 346?355 (1959)","journal-title":"IEEE Trans. Electron. Comput."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1109\/TEC.1959.5222756","volume":"8","author":"S. Ginsburg","year":"1959","unstructured":"Ginsburg, S.: A Synthesis Technique for Minimal State Sequential Machines. IEEE Trans. Electron. Comput. 8, 13?24 (1959)","journal-title":"IEEE Trans. Electron. Comput."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1145\/321043.321045","volume":"7","author":"S. Ginsburg","year":"1960","unstructured":"Ginsburg, S.: Connective Properties Preserved in Minimal State Machines. J. Assoc. Comput. Mach. 7, 311?325 (1960)","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1145\/321075.321083","volume":"6","author":"S. Ginsburg","year":"1961","unstructured":"Ginsburg, S.: Compatibility of States in Input Independent Machines. J. ACM 6, 400?403 (1961)","journal-title":"J. ACM"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1109\/PGEC.1965.264140","volume":"14","author":"A. Grasselli","year":"1965","unstructured":"Grasselli, A., Luccio, F.: A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks. IEEE Trans. Electron. Comput. 14, 350?359 (1965)","journal-title":"IEEE Trans. Electron. Comput."},{"key":"CR20","first-page":"136","volume":"7","author":"A. Grasselli","year":"1966","unstructured":"Grasselli, A., Luccio, F.: A Method for Combined Row-Column Reduction of Flow Tables. Proc. 7th. SWAT, 7, 136?147 (1966)","journal-title":"Proc. 7th. SWAT"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1109\/PGEC.1966.264308","volume":"15","author":"A. Grasselli","year":"1966","unstructured":"Grasselli, A.: Minimal Closed Partitious for Incompletely Specified Flow Tables. IEEE Trans. Electron. Comput. 15, 245?249 (1966)","journal-title":"IEEE Trans. Electron. Comput."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1109\/T-C.1975.224318","volume":"24","author":"F. Handoko","year":"1975","unstructured":"Handoko, F.: A Discussion on Two Algorithms for Determining Maximum Compatibles. IEEE Trans. Comput. 24, 838?840 (1975)","journal-title":"IEEE Trans. Comput."},{"key":"CR23","doi-asserted-by":"crossref","first-page":"1108","DOI":"10.1109\/T-C.1970.222842","volume":"19","author":"R.W. House","year":"1970","unstructured":"House, R.W., Stevens, D.W.: A New Rule for Reducing CC-Tables. IEEE Trans. Comput. 19, 1108?1111(1970)","journal-title":"IEEE Trans. Comput."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1109\/T-C.1970.222920","volume":"19","author":"J. Kella","year":"1970","unstructured":"Kella, J.: State Minimization of Incompletely Specified Sequential Machines. IEEE Trans. Comput. 19, 342?348 (1970)","journal-title":"IEEE Trans. Comput."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"1440","DOI":"10.1109\/T-C.1972.223521","volume":"21","author":"J. Kim","year":"1972","unstructured":"Kim, J., Newborn, M.M.: The Simplification of Sequential Machines with Input Restrictions. IEEE Trans. Comput. 21, 1440?1443 (1972)","journal-title":"IEEE Trans. Comput."},{"key":"CR26","unstructured":"Kohavi, Z.: Minimization of Incompletely Specified Sequential Switching Circuits. Res. Rept. Polytechn., Inst. of Brooklyn, 1962"},{"key":"CR27","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1109\/PGEC.1966.264573","volume":"15","author":"F. Luccio","year":"1966","unstructured":"Luccio, F.: Reduction of the Number of Colums in Flow-Table Minimization. IEEE Trans. Electron. Comput. 15, 803?805 (1966)","journal-title":"IEEE Trans. Electron. Comput."},{"key":"CR28","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1109\/T-C.1969.222706","volume":"18","author":"F. Luccio","year":"1969","unstructured":"Luccio, F.: Extending the Definition of Prime Compatibility Classes of States in Incomplete Sequential Machine Reduction. IEEE Trans. Comput. 18, 537?540 (1969)","journal-title":"IEEE Trans. Comput."},{"key":"CR29","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1147\/rd.85.0537","volume":"8","author":"M.P. Marcus","year":"1964","unstructured":"Marcus, M.P.: Derivation of Maximal Compatibles Using Boolean Algebra. IBM J. Res. Dev. 8, 537?538 (1964)","journal-title":"IBM J. Res. Dev."},{"key":"CR30","doi-asserted-by":"crossref","first-page":"1759","DOI":"10.1002\/j.1538-7305.1962.tb00491.x","volume":"41","author":"E.J. McCluskey","year":"1962","unstructured":"McCluskey, E.J.: Minimum State Sequential Circuits for a Restricted Class of Incomplete Specified Flow Tables. Bell Syst. Tech. J. 41, 1759?1768 (1962)","journal-title":"Bell Syst. Tech. J."},{"key":"CR31","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1109\/PGEC.1967.264674","volume":"16","author":"M.S. Meisel","year":"1967","unstructured":"Meisel, M.S.: A Note on Internal State Minimization in Incompletely Specified Sequential Networks. IEEE Trans. Electron. Comput. 16, 508?509 (1967)","journal-title":"IEEE Trans. Electron. Comput."},{"key":"CR32","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1109\/TEC.1961.5219246","volume":"10","author":"R. Narasimhan","year":"1961","unstructured":"Narasimhan, R.: Minimizing Incompletely Specified Sequential Switching Functions. IEEE Trans. Electron. Comput. 10, 531?532 (1961)","journal-title":"IEEE Trans. Electron. Comput."},{"key":"CR33","first-page":"450","volume":"20","author":"D. Pager","year":"1971","unstructured":"Pager, D.: Conditions for the Existence of Minimal Covers Composed of Maximal Compatibles. IEEE Trans. Comput. 20, 450?452 (1971)","journal-title":"IEEE Trans. Comput."},{"key":"CR34","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1049\/el:19790491","volume":"15","author":"G. Palama","year":"1979","unstructured":"Palama, G., Russo, G.V.: Minimization of Incomplete Specified Sequential Machines: ?The Really? Excluded Compatibility Classes. Electron. Lett. 15, 690?691 (1979)","journal-title":"Electron. Lett."},{"key":"CR35","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1109\/TEC.1959.5222697","volume":"8","author":"M.C. Paull","year":"1959","unstructured":"Paull, M.C., Unger, S.H.: Minimizing the Number of States Incompletely Specified Sequential Switching Functions. IEEE Trans. Electron. Comput. 8, 356?367 (1959)","journal-title":"IEEE Trans. Electron. Comput."},{"key":"CR36","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1109\/T-C.1973.223655","volume":"22","author":"C.P. Pleeger","year":"1973","unstructured":"Pleeger, C.P.: State Reduction in Incompletely Specified Finite State Machines. IEEE Trans. Comput. 22, 1099?1102 (1973)","journal-title":"IEEE Trans. Comput."},{"key":"CR37","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/BF01695628","volume":"3","author":"R.E. Prather","year":"1969","unstructured":"Prather, R.E.: Minimal Solutions of Paull-Unger Problems. Math. Syst. Theory 3, 76?85 (1969)","journal-title":"Math. Syst. Theory"},{"key":"CR38","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1109\/T-C.1971.223294","volume":"20","author":"R.E. Prather","year":"1971","unstructured":"Prather, R.E.: An Algebraic Proof of the Paull-Unger Theorem. IEEE Trans. Comput. 20, 578?580 (1971)","journal-title":"IEEE Trans. Comput."},{"key":"CR39","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1109\/T-C.1975.224137","volume":"24","author":"C.V.S. Rao","year":"1975","unstructured":"Rao, C.V.S., Biswas, N.N.: Minimization of Incompletely Specified Sequential Machines. IEEE Trans. Comput. 24, 1089?1100 (1975)","journal-title":"IEEE Trans. Comput."},{"key":"CR40","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1109\/TC.1976.1674690","volume":"25","author":"C.V.S. Rao","year":"1976","unstructured":"Rao, C.V.S., Biswas, N.N.: Further Comments on Closure Partition Method for Minimizing Incomplete Sequential Machines. IEEE Trans. Comput. 25, 767?768 (1976)","journal-title":"IEEE Trans. Comput."},{"key":"CR41","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1109\/PGEC.1965.264260","volume":"14","author":"I.S. Reed","year":"1965","unstructured":"Reed, I.S.: Some Remarks on State Reduction of Asynchronous Circuits by the Paull-Unger Method. IEEE Trans. Electron. Comput. 14, 262?265 (1965)","journal-title":"IEEE Trans. Electron. Comput."},{"key":"CR42","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1109\/TC.1972.5008956","volume":"21","author":"P.K.S. Roy","year":"1972","unstructured":"Roy, P.K.S., Sheng, C.L.: A Decomposition Method of Determining Maximum Compatibles. IEEE Trans. Comput. 21, 309?312 (1972)","journal-title":"IEEE Trans. Comput."},{"key":"CR43","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1109\/T-C.1975.224315","volume":"24","author":"F. Rubin","year":"1975","unstructured":"Rubin, F.: Worst Case Bounds for Maximal Compatible Subsets. IEEE Trans. Comput. 24, 830?831 (1975)","journal-title":"IEEE Trans. Comput."},{"key":"CR44","first-page":"760","volume":"48","author":"G.V. Russo","year":"1979","unstructured":"Russo, G.V., Palama, G.: Gli insiemi primi chiusi di classi di compatibilit\ufffd. Alta Frequenta, XLVIII. 48, 760?765 (1979)","journal-title":"Alta Frequenta, XLVIII"},{"key":"CR45","first-page":"199","volume":"6","author":"G.V. Russo","year":"1980","unstructured":"Russo, G.V., Palama, G.: Minimization of Incompletely Specified Sequential Machines. Digital Processes 6, 199?206 (1980)","journal-title":"Digital Processes"},{"key":"CR46","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/BF03047026","volume":"50","author":"C.V. Srinivasan","year":"1959","unstructured":"Srinivasan, C.V., Narasinham, R.: On the Synthesis of Finite Sequential Machines. Proc. Indian Acad. Sci. 50, 68?82 (1959)","journal-title":"Proc. Indian Acad. Sci."},{"key":"CR47","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1109\/T-C.1974.223786","volume":"23","author":"K.E. Stoffers","year":"1974","unstructured":"Stoffers, K.E.: Sequential Algorithm for the Determination of Maximum Compatibles. IEEE Trans. Comput. 23, 95?98 (1974)","journal-title":"IEEE Trans. Comput."},{"key":"CR48","first-page":"2176","volume":"26","author":"V.I. Troslin","year":"1965","unstructured":"Troslin, V.I.: Algebraic Method for the Minimization on Incompletely Specified Sequential Machines. Autom. Remote Control 26, 2176?2181 (1965)","journal-title":"Autom. Remote Control"},{"key":"CR49","unstructured":"Unger, S.H.: Simplification of State Tables. AIEE Fall Meeting, Chicago, 1960"},{"key":"CR50","first-page":"145","volume-title":"A Survey of Switching Circuit Theory","author":"S.H. Unger","year":"1962","unstructured":"Unger, S.H.: Simplification of State Tables. In: A Survey of Switching Circuit Theory (E.J. McCluskey, T.C. Bartel, eds.), pp. 145?170. New York: McGraw-Hill 1962"},{"key":"CR51","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1109\/PGEC.1965.264157","volume":"14","author":"S.H. Unger","year":"1965","unstructured":"Unger, S.H.: Flow Table Simplification ? Some Useful Aids. IEEE Trans. Electron. Comput. 14, 472?495 (1965)","journal-title":"IEEE Trans. Electron. Comput."},{"key":"CR52","doi-asserted-by":"crossref","first-page":"732","DOI":"10.1109\/TC.1980.1675655","volume":"29","author":"M. Yamamoto","year":"1980","unstructured":"Yamamoto, M.: A Method for Minimizing Incompletely Specified Sequential Machines. IEEE Trans. Comput. 29, 732?736 (1980)","journal-title":"IEEE Trans. Comput."},{"key":"CR53","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1109\/T-C.1973.223657","volume":"22","author":"C.C. Yang","year":"1973","unstructured":"Yang, C.C.: Closure Partition Method for Minimizing Incomplete Sequential Machines. IEEE Trans. Comput. 22, 1109?1122 (1973)","journal-title":"IEEE Trans. Comput."},{"key":"CR54","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/T-C.1975.224090","volume":"24","author":"C.C. Yang","year":"1975","unstructured":"Yang, C.C., Babinski, M.K.: Comments on Closure Partition Method for Minimizing Incomplete Sequential Machines. IEEE Trans. Comput. 24, 106?108 (1975)","journal-title":"IEEE Trans. Comput."},{"key":"CR55","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"Theory of Machines and Computations","author":"J. Hopcroft","year":"1971","unstructured":"Hopcroft, J.: An n log n Algorithm for Minimizing States in a Finite Automaton. In: Theory of Machines and Computations (Z. Kohavi, A. Paz, eds.), pp. 189?196. New York: Academic Press 1971"},{"key":"CR56","volume-title":"Switching and Finite Automata Theory","author":"Z. Kohavi","year":"1970\/78","unstructured":"Kohavi, Z.: Switching and Finite Automata Theory. New York: McGraw-Hill 1970\/78"},{"key":"CR57","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF00625280","volume":"18","author":"M. Broy","year":"1982","unstructured":"Broy, M., Wirsing, M.: Partial Abstract Types. Acta Inf. 18, 47?64 (1982)","journal-title":"Acta Inf."},{"key":"CR58","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-96644-5","volume-title":"Universal Theory of Automata","author":"H. Ehrig","year":"1974","unstructured":"Ehrig, H., Kiermeier, K.-D., Kreowski, H.-J., Kuehnel, W.: Universal Theory of Automata. Stuttgart: Teubner 1974"},{"key":"CR59","volume-title":"Logic Design and Switching Theory","author":"S. Muroga","year":"1979","unstructured":"Muroga, S.: Logic Design and Switching Theory. New York: John Wiley 1979"},{"key":"CR60","unstructured":"Reusch, B.: A Note on State Reduction and Homomorphisms for Incompletely Specified Sequential Machines. Universit\ufffdt Dortmund, Abteilung Informatik, Forschungsbericht Nr. 120, 1981"},{"key":"CR61","volume-title":"Abstrakte Automaten","author":"P. Starke","year":"1969","unstructured":"Starke, P.: Abstrakte Automaten. Berlin (DDR): VEB Deutscher Verlag der Wissenschaften 1969"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00263650.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00263650\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00263650","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T13:14:33Z","timestamp":1554297273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00263650"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,3]]},"references-count":61,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1986,3]]}},"alternative-id":["BF00263650"],"URL":"https:\/\/doi.org\/10.1007\/bf00263650","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,3]]}}}