{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T12:04:05Z","timestamp":1781870645967,"version":"3.54.5"},"reference-count":26,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"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":4764,"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":[[2000,7]]},"DOI":"10.1016\/s0304-3975(98)00225-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:30:26Z","timestamp":1027614626000},"page":"247-281","source":"Crossref","is-referenced-by-count":26,"title":["PSPACE-complete problems for subgroups of free groups and inverse finite automata"],"prefix":"10.1016","volume":"242","author":[{"given":"J.-C.","family":"Birget","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S.","family":"Margolis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.","family":"Meakin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"P.","family":"Weil","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00225-4_BIB1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0304-3975(84)90024-0","article-title":"The Nielsen reduction and P-complete problems in free groups","volume":"32","author":"Avenhaus","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00225-4_BIB2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(84)90046-X","article-title":"On the complexity of intersection and conjugacy problems in free groups","volume":"32","author":"Avenhaus","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00225-4_BIB3","doi-asserted-by":"crossref","unstructured":"L. Babai, E. Luks, A. Seress, Permutation groups in NC, Proc. 19th ACM Annual Symp. on Theory of Computing, 1987, pp. 409\u2013420.","DOI":"10.1145\/28395.28439"},{"key":"10.1016\/S0304-3975(98)00225-4_BIB4","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1137\/0218053","article-title":"Time\/Space tradeoffs for reversible computation","volume":"18","author":"Bennett","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(98)00225-4_BIB5","doi-asserted-by":"crossref","unstructured":"J. Berstel, Transductions and Context-Free Languages, Teubner, Stuttgart, 1979.","DOI":"10.1007\/978-3-663-09367-1"},{"key":"10.1016\/S0304-3975(98)00225-4_BIB6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0304-3975(91)90075-D","article-title":"Finite-automaton aperiodicity is PSPACE-complete","volume":"88","author":"Cho","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00225-4_BIB7","series-title":"Combinatorial Group Theory","author":"Cohen","year":"1989"},{"key":"10.1016\/S0304-3975(98)00225-4_BIB8","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1142\/S0218196793000263","article-title":"Inverse monoids of dot-depth two","volume":"3","author":"Cowan","year":"1993","journal-title":"Internat. J. Algebra Comput."},{"key":"10.1016\/S0304-3975(98)00225-4_BIB9","series-title":"Automata, Languages and Machines, vol. B","author":"Eilenberg","year":"1976"},{"key":"10.1016\/S0304-3975(98)00225-4_BIB10","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(98)00225-4_BIB11","series-title":"Introduction to Automata Theory, Formal Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(98)00225-4_BIB12","doi-asserted-by":"crossref","unstructured":"D. Kozen, Lower bounds for natural proof systems, Proc. 18th IEEE Annual Symp. on Foundations of Computer Science, 1977, pp. 254\u2013266.","DOI":"10.1109\/SFCS.1977.16"},{"key":"10.1016\/S0304-3975(98)00225-4_BIB13","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/0219046","article-title":"A note on Bennett's time-space tradeoff for reversible computations","volume":"19","author":"Levine","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(98)00225-4_BIB14","series-title":"Combinatorial Group Theory","author":"Lyndon","year":"1977"},{"key":"10.1016\/S0304-3975(98)00225-4_BIB15","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1142\/S021819679300007X","article-title":"Free inverse monoids and graph immersions","volume":"3","author":"Margolis","year":"1993","journal-title":"Internat. J. Algebra Comput."},{"key":"10.1016\/S0304-3975(98)00225-4_BIB16","series-title":"Counter-free Automata","author":"McNaughton","year":"1971"},{"key":"10.1016\/S0304-3975(98)00225-4_BIB17","series-title":"Inverse Monoids","author":"Petrich","year":"1984"},{"key":"10.1016\/S0304-3975(98)00225-4_BIB18","doi-asserted-by":"crossref","unstructured":"J.-E. Pin, Vari\u00e9t\u00e9s de langages formels, Masson, Paris, 1984. English translation: Varieties of formal languages, North Oxford, London, 1986.","DOI":"10.1007\/978-1-4613-2215-3_3"},{"key":"10.1016\/S0304-3975(98)00225-4_BIB19","unstructured":"K. Reidemeister, Fundamentalgruppen und \u00dcberlagerungsr\u00e4ume, Nachrichten der Ges. Wiss., Math. Phys. Klasse G\u00f6ttingen, 1928, pp. 69\u201376."},{"key":"10.1016\/S0304-3975(98)00225-4_BIB20","unstructured":"R. Ruyle, Pseudovarieties of inverse monoids Ph.D. Dissertation, University of Nebraska-Lincoln, 1997."},{"key":"10.1016\/S0304-3975(98)00225-4_BIB21","doi-asserted-by":"crossref","first-page":"499","DOI":"10.2307\/2322573","article-title":"A problem on rational subsets of the free group","volume":"91","author":"Sakarovitch","year":"1984","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0304-3975(98)00225-4_BIB22","series-title":"Computation with Finitely Presented Groups","author":"Sims","year":"1995"},{"key":"10.1016\/S0304-3975(98)00225-4_BIB23","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/BF02095993","article-title":"The topology of graphs","volume":"71","author":"Stallings","year":"1983","journal-title":"Invent. Math."},{"key":"10.1016\/S0304-3975(98)00225-4_BIB24","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0019-9958(85)80058-9","article-title":"Complexity of some problems from the theory of automata","volume":"66","author":"Stern","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(98)00225-4_BIB25","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1142\/S0218196792000141","article-title":"Refining known results on the generalized word problem for free groups","volume":"2","author":"Stewart","year":"1992","journal-title":"Internat. J. Algebra Comput."},{"key":"10.1016\/S0304-3975(98)00225-4_BIB26","unstructured":"P. Weil, Inverse monoids and the dot-depth hierarchy, Ph.D. Dissertation, University of Nebraska-Lincoln, 1988."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002254?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002254?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T03:59:26Z","timestamp":1579147166000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598002254"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0304397598002254"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00225-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}