{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:12:54Z","timestamp":1760202774418,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319946306"},{"type":"electronic","value":"9783319946313"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94631-3_3","type":"book-chapter","created":{"date-parts":[[2018,7,10]],"date-time":"2018-07-10T06:09:52Z","timestamp":1531202992000},"page":"24-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Word Problem Languages for Free Inverse Monoids"],"prefix":"10.1007","author":[{"given":"Tara","family":"Brough","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1145\/321526.321529","volume":"16","author":"A Aho","year":"1969","unstructured":"Aho, A.: Nested stack automata. J. ACM 16(3), 383\u2013406 (1969)","journal-title":"J. ACM"},{"issue":"70","key":"3_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.2307\/1970103","volume":"2","author":"WW Boone","year":"1959","unstructured":"Boone, W.W.: The word problem. Ann. Math. 2(70), 207\u2013265 (1959)","journal-title":"Ann. Math."},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1515\/gcc-2014-0002","volume":"6","author":"T Brough","year":"2014","unstructured":"Brough, T.: Groups with poly-context-free word problem. Groups Complex. Cryptol. 6(1), 9\u201329 (2014)","journal-title":"Groups Complex. Cryptol."},{"key":"3_CR4","unstructured":"Brough, T.: Inverse semigroups with rational word problem are finite, Unpublished note. arxiv:1311.3955 (2013)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-662-47666-6_11","volume-title":"Automata, Languages, and Programming","author":"L Ciobanu","year":"2015","unstructured":"Ciobanu, L., Diekert, V., Elder, M.: Solution sets for equations over free groups are EDT0L languages. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 134\u2013145. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47666-6_11"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1142\/S0218196718500145","volume":"28","author":"L Ciobanu","year":"2018","unstructured":"Ciobanu, L., Elder, M., Ferov, M.: Applications of L systems to group theory. Int. J. Algebra Comput. 28, 309\u2013329 (2018)","journal-title":"Int. J. Algebra Comput."},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1017\/S0305004103007497","volume":"136","author":"A Duncan","year":"2004","unstructured":"Duncan, A., Gilman, R.H.: Word hyperbolic semigroups. Math. Proc. Camb. Philos. Soc. 136, 513\u2013524 (2004)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1142\/S0218196711006893","volume":"21","author":"ND Gilbert","year":"2011","unstructured":"Gilbert, N.D., Noonan Heale, R.: The idempotent problem for an inverse monoid. Int. J. Algebra Comput. 21, 1170\u20131194 (2011)","journal-title":"Int. J. Algebra Comput."},{"key":"3_CR9","unstructured":"Gilman, R.H., Shapiro, M.: On groups whose word problem is solved by a nested stack automaton. arxiv:math\/9812028"},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1145\/321386.321403","volume":"14","author":"S Ginsburg","year":"1967","unstructured":"Ginsburg, S., Greibach, S.A., Harrison, M.A.: One-way stack automata. J. ACM 14(2), 389\u2013418 (1967)","journal-title":"J. ACM"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/S0022-0000(69)80012-7","volume":"3","author":"S Greibach","year":"1969","unstructured":"Greibach, S.: Checking automata and one-way stack languages. J. Compt. Syst. Sci. 3, 196\u2013217 (1969)","journal-title":"J. Compt. Syst. Sci."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Hoffman, M., Holt, D.F., Owens, M.D., Thomas, R.M.: Semigroups with a context-free word problem. In: Proceedings of the 16th International Conference on Developments in Language Theory, DLT 2012, pp. 97\u2013108 (2012)","DOI":"10.1007\/978-3-642-31653-1_10"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1017\/S1446788708000864","volume":"85","author":"DF Holt","year":"2005","unstructured":"Holt, D.F., Owens, M.D., Thomas, R.M.: Groups and semigroups with a one-counter word problem. J. Aust. Math. Soc. 85, 197\u2013209 (2005)","journal-title":"J. Aust. Math. Soc."},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1112\/S002461070500654X","volume":"71","author":"DF Holt","year":"2005","unstructured":"Holt, D.F., R\u00f6ver, C.E., Rees, S.E., Thomas, R.M.: Groups with a context-free co-word problem. J. Lond. Math. Soc. 71, 643\u2013657 (2005)","journal-title":"J. Lond. Math. Soc."},{"key":"3_CR15","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Boston (1979)"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1142\/S0218196715400032","volume":"25","author":"M Kambites","year":"2015","unstructured":"Kambites, M.: Anisimov\u2019s Theorem for inverse semigroups. Int. J. Algebra Comput. 25, 41\u201349 (2015)","journal-title":"Int. J. Algebra Comput."},{"key":"3_CR17","doi-asserted-by":"publisher","DOI":"10.1142\/3645","volume-title":"Inverse Semigroups: The Theory of Partial Symmetries","author":"MV Lawson","year":"1998","unstructured":"Lawson, M.V.: Inverse Semigroups: The Theory of Partial Symmetries. World Scientific, Singapore (1998)"},{"issue":"8","key":"3_CR18","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1016\/j.ic.2007.01.002","volume":"205","author":"M Lohrey","year":"2007","unstructured":"Lohrey, M., Ondrusch, N.: Inverse monoids: decidability and complexity of algebraic questions. Inf. Comput. 205(8), 1212\u20131234 (2007)","journal-title":"Inf. Comput."},{"key":"3_CR19","first-page":"155","volume":"37","author":"LP Lisovik","year":"1980","unstructured":"Lisovik, L.P., Red\u2019ko, V.N.: Regular events in semigroups. Problemy Kibernetiki 37, 155\u2013184 (1980)","journal-title":"Problemy Kibernetiki"},{"issue":"3","key":"3_CR20","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1112\/plms\/s3-29.3.385","volume":"s3\u201329","author":"WD Munn","year":"1974","unstructured":"Munn, W.D.: Free inverse semigroups. Proc. Lond. Math. Soc. s3\u201329(3), 385\u2013404 (1974)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"9","key":"3_CR21","first-page":"1","volume":"2","author":"PS Novikov","year":"1958","unstructured":"Novikov, P.S.: On the algorithmic unsolvability of the word problem in group theory. Am. Math. Soc. Transl. Ser. 2(9), 1\u2013122 (1958)","journal-title":"Am. Math. Soc. Transl. Ser."},{"key":"3_CR22","unstructured":"Pfeiffer, M.J.: Adventures in applying iteration lemmas, Ph.D. thesis, University of St Andrews (2013)"},{"issue":"1","key":"3_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2267170","volume":"12","author":"E Post","year":"1947","unstructured":"Post, E.: Recursive unsolvability of a problem of Thue. J. Symb. Log. 12(1), 1\u201311 (1947)","journal-title":"J. Symb. Log."},{"key":"3_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-95486-3","volume-title":"The Book of L","author":"G Rozenberg","year":"1986","unstructured":"Rozenberg, G., Salomaa, A.: The Book of L. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/978-3-642-95486-3"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"van Leeuwen, J.: Variations of a new machine model. In: Conference Record 17th Annual IEEE Symposium on Foundations of Computer Science, pp. 228\u2013235 (1976)","DOI":"10.1109\/SFCS.1976.35"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94631-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:15:41Z","timestamp":1710324941000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94631-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319946306","9783319946313"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94631-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"11 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Halifax, NS","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cs.smu.ca\/~dcfs2018\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}