{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T11:14:01Z","timestamp":1649070841834},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1993,7]]},"DOI":"10.1007\/bf01189856","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T21:46:49Z","timestamp":1108676809000},"page":"379-395","source":"Crossref","is-referenced-by-count":6,"title":["Concise representations of regular languages by degree and probabilistic finite automata"],"prefix":"10.1007","volume":"26","author":[{"given":"Chandra M. R.","family":"Kintala","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kong -Yee","family":"Pun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Detlef","family":"Wotschke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0304-3975(88)90164-8","volume":"57","author":"F. M. Ablyv","year":"1988","unstructured":"F. M. Ablyv. The complexity properties of probabilistic automata with isolated cutpoints.Theoretical Computer Science, 57:87?95, December 1988.","journal-title":"Theoretical Computer Science"},{"key":"CR2","unstructured":"D. Drusinsky and D. Harel. On the power of bounded concurrency, i: The finite automata level. Technical Report CS89-20, Department of Computer Science, The Weizmann Institute of Science, Rehovot, September 1989."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0304-3975(83)90016-6","volume":"26","author":"J. Hartmanis","year":"1983","unstructured":"J. Hartmanis. On G\u00f6del speed-up and succinctness of language representations.Theoretical Computer Science, 26:335?342, 1983.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"CR4","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1109\/32.54292","volume":"16","author":"D. Harel","year":"1990","unstructured":"D. Harel, H. Lachover, A. Naamad, A. Pnueli, M. Politi, R. Sherman, A. Shtull-Trauring, and M. Trakhtenbrot. Stalemate: A working environment for the development of complex reactive systems.IEEE Transactions on Software Engineering, 16(4):403?414, April 1990.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"D. Kozen. On parallelism in Turing machines.Proceedings of the 17th IEEE Symposium on Foundations of Computer Science, pages 89?97, October 1976.","DOI":"10.1109\/SFCS.1976.20"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF00263994","volume":"13","author":"C. M. R. Kintala","year":"1980","unstructured":"C. M. R. Kintala and D. Wotschke. Amounts of nondeterminism in finite automata.Acta Informatica, 13:199?204, 1980.","journal-title":"Acta Informatica"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"C. M. R. Kintala and D. Wotschke. Concurrent conciseness of degree, probabilistic, nondeterministic, and deterministic finite automata.Proceedings of the 3rd Symposium on Theoretical Aspects of Computer Science, pages 291?305, January 1986.","DOI":"10.1007\/3-540-16078-7_84"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0304-3975(81)80005-9","volume":"13","author":"E. Leiss","year":"1981","unstructured":"E. Leiss. Succinct representation of regular languages by boolean automata.Theoretical Computer Science, 13:323?330, 1981.","journal-title":"Theoretical Computer Science"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0304-3975(85)90215-4","volume":"38","author":"E. Leiss","year":"1985","unstructured":"E. Leiss. Succinct representation of regular languages by boolean automata, ii.Theoretical Computer Science, 38:133?136, 1985.","journal-title":"Theoretical Computer Science"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"A. R. Meyer and M. J. Fischer. Economy of description by automata, grammars, and formal systems. InProceedings of Symposium on Switching and Automata Theory, pages 188?191, 1971.","DOI":"10.1109\/SWAT.1971.11"},{"key":"CR11","volume-title":"Introduction to Probabilistic Automata","author":"A. Paz","year":"1971","unstructured":"A. Paz.Introduction to Probabilistic Automata. Academic Press, Reading, MA, 1971."},{"key":"CR12","volume-title":"Master's theis","author":"K. Y. Pun","year":"1986","unstructured":"K. Y. Pun. Descriptive conciseness of degree automata. Master's theis, Pennsylvania State University, University Park, PA, 1986."},{"key":"CR13","volume-title":"Sequential Machines","author":"M. O. Rabin","year":"1964","unstructured":"M. O. Rabin. Probabilistic automata. In E. F. Moore, editor,Sequential Machines. Addison-Wesley, Reading, MA, 1964. Also appeared inInformation and Control, 6(3):230?245, 1963."},{"issue":"6","key":"CR14","doi-asserted-by":"crossref","first-page":"1263","DOI":"10.1137\/0218083","volume":"18","author":"B. Ravikumar","year":"1989","unstructured":"B. Ravikumar and O. H. Ibarra. Relating the type of ambiguity of finite automata to the succinctness of their representations.SIAM Journal on Computing, 18(6): 1263?1282, December 1989.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"CR15","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1137\/0214044","volume":"14","author":"R. E. Stearns","year":"1985","unstructured":"R. E. Stearns and H. B. Hunt, III. On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata.SIAM Journal on Computing, 14(3):598?611, August 1985.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"CR16","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0022-0000(77)80012-3","volume":"14","author":"D. Wotschke","year":"1977","unstructured":"D. Wotschke. Degree languages: A new concept of acceptance.Journal of Computer and System Sciences, 14(2): 187?199, 1977.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01189856.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01189856\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01189856","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:36:48Z","timestamp":1586119008000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01189856"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["BF01189856"],"URL":"https:\/\/doi.org\/10.1007\/bf01189856","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}