{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:17:13Z","timestamp":1725466633654},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316524"},{"type":"electronic","value":"9783642316531"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31653-1_22","type":"book-chapter","created":{"date-parts":[[2012,7,14]],"date-time":"2012-07-14T09:51:39Z","timestamp":1342259499000},"page":"239-250","source":"Crossref","is-referenced-by-count":2,"title":["Unambiguous Constrained Automata"],"prefix":"10.1007","author":[{"given":"Micha\u00ebl","family":"Cadilhac","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Finkel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"McKenzie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-21493-6_6","volume-title":"Algebraic Informatics","author":"C. Behle","year":"2011","unstructured":"Behle, C., Krebs, A., Reifferscheid, S.: Typed Monoids \u2013 An Eilenberg-Like Theorem for Non Regular Languages. In: Winkler, F. (ed.) CAI 2011. LNCS, vol.\u00a06742, pp. 97\u2013114. Springer, Heidelberg (2011)"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Cadilhac, M., Finkel, A., McKenzie, P.: Bounded Parikh automata. In: WORDS, pp. 93\u2013102 (2011)","DOI":"10.4204\/EPTCS.63.13"},{"key":"22_CR3","unstructured":"Cadilhac, M., Finkel, A., McKenzie, P.: On the expressiveness of Parikh automata and related models. In: NCMA, pp. 103\u2013119 (2011)"},{"key":"22_CR4","unstructured":"Colcombet, T.: Forms of determinism for automata. In: STACS, pp. 1\u201323 (2012)"},{"issue":"2","key":"22_CR5","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.: Semigroups, Presburger formulas and languages. Pacific Journal of Mathematics\u00a016(2), 285\u2013296 (1966)","journal-title":"Pacific Journal of Mathematics"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Ginsburg, S., Spanier, E.: Bounded ALGOL-like languages (1964)","DOI":"10.2307\/1994067"},{"issue":"5","key":"22_CR7","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1090\/S0002-9939-1966-0201310-3","volume":"17","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Bounded regular sets. Proceedings of the American Mathematical Society\u00a017(5), 1043\u20131049 (1966)","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"1","key":"22_CR8","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"O.H. Ibarra","year":"1978","unstructured":"Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. J. ACM\u00a025(1), 116\u2013133 (1978)","journal-title":"J. ACM"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/3-540-45061-0_54","volume-title":"Automata, Languages and Programming","author":"F. Klaedtke","year":"2003","unstructured":"Klaedtke, F., Rue\u00df, H.: Monadic Second-Order Logics with Cardinalities. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 681\u2013696. Springer, Heidelberg (2003)"},{"issue":"3","key":"22_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0166-218X(00)00200-6","volume":"108","author":"V. Mitrana","year":"2001","unstructured":"Mitrana, V., Stiebe, R.: Extended finite automata over groups. Discrete Appl. Math.\u00a0108(3), 287\u2013300 (2001)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"22_CR11","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R.J. Parikh","year":"1966","unstructured":"Parikh, R.J.: On context-free languages. Journal of the ACM\u00a013(4), 570\u2013581 (1966)","journal-title":"Journal of the ACM"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195218"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31653-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:54:55Z","timestamp":1558313695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31653-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316524","9783642316531"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31653-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}