{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T07:00:15Z","timestamp":1648882815378},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11520,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1982]]},"DOI":"10.1016\/0304-3975(82)90134-7","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T17:17:57Z","timestamp":1032283077000},"page":"99-102","source":"Crossref","is-referenced-by-count":0,"title":["Decidability of \u201cSkolem matrix emptiness problem\u201d entails constructability of exact regular expression"],"prefix":"10.1016","volume":"17","author":[{"given":"Marek","family":"Karpinski","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(82)90134-7_BIB1","doi-asserted-by":"crossref","first-page":"175","DOI":"10.24033\/bsmf.1823","article-title":"Deux probl\u00e8mes decidables des suites recurrentes lineaires","volume":"104","author":"Berstel","year":"1976","journal-title":"Bull. Soc. Math. France"},{"key":"10.1016\/0304-3975(82)90134-7_BIB2","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0304-3975(82)90134-7_BIB3","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1016\/S0022-0000(70)80018-6","article-title":"What makes some language theory problems undecidable","volume":"4","author":"Hartmanis","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(82)90134-7_BIB4","article-title":"Note on multiplicity languages","author":"Karpinski","year":"1975","journal-title":"Math. Inst. Polish Acad. Sci."},{"key":"10.1016\/0304-3975(82)90134-7_BIB5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1007\/3-540-08860-1_23","article-title":"Some effective results about linear recursive sequences","volume":"62","author":"Mignotte","year":"1978"},{"key":"10.1016\/0304-3975(82)90134-7_BIB6","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/S0019-9958(68)90353-7","article-title":"Fuzzy events realized by finite probabilistic automata","volume":"12","author":"Nasu","year":"1968","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(82)90134-7_BIB7","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/S0019-9958(69)90449-5","article-title":"Mappings induced by PGSM-mappings and some recursively unsolvable problems of finite probabilistic automata","volume":"15","author":"Nasu","year":"1969","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(82)90134-7_BIB8","article-title":"Einige S\u00e4tze \u00fcber gewisse Reihenentwicklungen und exponentiale Beziehungen mit Anwendung auf diophantische Gleichungen","volume":"6","author":"Skolem","year":"1933","journal-title":"Oslo Vid. Akad., Skrifter I"},{"key":"10.1016\/0304-3975(82)90134-7_BIB9","first-page":"163","article-title":"Ein Verfahren zur Behandlung gewisser exponentialer Gleichungen und diophantischer Gleichungen","author":"Skolem","year":"1934","journal-title":"C.r. 8 congr. Scan. \u00e0 Stockholm"},{"key":"10.1016\/0304-3975(82)90134-7_BIB10","doi-asserted-by":"crossref","first-page":"885","DOI":"10.2307\/2034080","article-title":"On a theorem of Jungen","volume":"13","author":"Schutzenberger","year":"1962","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(82)90134-7_BIB11","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/S0019-9958(68)90360-4","article-title":"On stochastic languages","volume":"12","author":"Turakainen","year":"1968","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(82)90134-7_BIB12","first-page":"252","author":"Kannan","year":"1980","journal-title":"The orbit problem is decidable"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582901347?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582901347?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T15:50:26Z","timestamp":1554825026000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397582901347"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982]]}},"alternative-id":["0304397582901347"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90134-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1982]]}}}