{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:06Z","timestamp":1725664026576},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582014"},{"type":"electronic","value":"9783540485667"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58201-0_75","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:32:55Z","timestamp":1330252375000},"page":"274-285","source":"Crossref","is-referenced-by-count":4,"title":["PSPACE-completeness of certain algorithmic problems on the subgroups of free groups"],"prefix":"10.1007","author":[{"given":"J. -C.","family":"Birget","sequence":"first","affiliation":[]},{"given":"S.","family":"Margolis","sequence":"additional","affiliation":[]},{"given":"J.","family":"Meakin","sequence":"additional","affiliation":[]},{"given":"P.","family":"Weil","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"L. Babai, E. Luks and A. Seress. Permutation groups in NC, Proceedings of the 19th ACM Annual Symposium on Theory of Computing (STOC) (1987), 409\u2013420.","DOI":"10.1145\/28395.28439"},{"key":"23_CR2","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1137\/0218053","volume":"18","author":"C. Bennett","year":"1989","unstructured":"C. Bennett. Time\/Space trade-offs for reversible computation, SIAM J. of Computing\n18 (1989), 766\u2013776.","journal-title":"SIAM J. of Computing"},{"key":"23_CR3","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0304-3975(91)90075-D","volume":"88","author":"S. Cho","year":"1991","unstructured":"S. Cho and D. Huynh. Finite-automaton aperiodicity is PSPACE-complete, Theor. Comput. Sci.\n88 (1991), 99\u2013116.","journal-title":"Theor. Comput. Sci."},{"key":"23_CR4","volume-title":"Automata, languages and machines, vol. B","author":"S. Eilenberg","year":"1976","unstructured":"S. Eilenberg. Automata, languages and machines, vol. B, Academic Press, New York, 1976."},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"D. Kozen. Lower bounds for natural proof systems, Proc. 18th IEEE Annual Symp. on Foundations of Computer Sci. (FOCS) (1977), 254\u2013266.","DOI":"10.1109\/SFCS.1977.16"},{"key":"23_CR6","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/0219046","volume":"19","author":"R. Levine","year":"1990","unstructured":"R. Levine and A. Sherman. A note on Bennett's time-space tradeoff for reversible computations, SIAM J. on Computing\n19 (1990), 673\u2013677.","journal-title":"SIAM J. on Computing"},{"key":"23_CR7","unstructured":"R. Lyndon and P. Schupp. Combinatorial group theory, Springer, 1977."},{"key":"23_CR8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1142\/S021819679300007X","volume":"3","author":"S. Margolis","year":"1993","unstructured":"S. Margolis and J. Meakin. Free inverse monoids and graph immersions, Intern. J. Algebra and Comp.\n3 (1993), 79\u201399.","journal-title":"Intern. J. Algebra and Comp."},{"key":"23_CR9","volume-title":"Inverse monoids","author":"M. Petrich","year":"1984","unstructured":"M. Petrich. Inverse monoids, Wiley, New York, 1984."},{"key":"23_CR10","volume-title":"Vari\u00e9t\u00e9s de langages formels","author":"J.-E. Pin","year":"1984","unstructured":"J.-E. Pin. Vari\u00e9t\u00e9s de langages formels, Masson, Paris, 1984. English translation: Varieties of formal languages, North Oxford, London, 1986."},{"key":"23_CR11","unstructured":"R. Ruyle. Ph. Dissertation, University of Nebraska-Lincoln, to appear."},{"key":"23_CR12","volume-title":"Arbres, amalgames et SL2, Ast\u00e9risque 46, 1977, Paris","author":"J.-P. Serre","year":"1980","unstructured":"J.-P. Serre. Arbres, amalgames et SL2, Ast\u00e9risque 46, 1977, Paris. English translation: Trees, Springer, New York, 1980."},{"key":"23_CR13","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/BF02095993","volume":"71","author":"J. Stallings","year":"1983","unstructured":"J. Stallings. The topology of graphs, Inventiones Mathematic\u00e6\n71 (1983), 551\u2013565.","journal-title":"Inventiones Mathematic\u00e6"},{"key":"23_CR14","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0019-9958(85)80058-9","volume":"66","author":"J. Stern","year":"1985","unstructured":"J. Stern. Complexity of some problems from the theory of automata, Inform. and Control\n66 (1985), 163\u2013176.","journal-title":"Inform. and Control"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58201-0_75.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:12:48Z","timestamp":1619557968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58201-0_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582014","9783540485667"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-58201-0_75","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}