{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T05:33:59Z","timestamp":1783402439641,"version":"3.54.6"},"reference-count":26,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1991]]},"DOI":"10.1051\/ita\/1991250302551","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T14:54:48Z","timestamp":1486047288000},"page":"255-272","source":"Crossref","is-referenced-by-count":31,"title":["On a subclass of context-free groups"],"prefix":"10.1051","volume":"25","author":[{"given":"Thomas","family":"Herbst","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. AALBERSBERG IJ. J. and ROZENBERG G., Theory of traces, Theoret. Comput. Sci., 1988., 60, pp. 1-82.9475320652.68017","DOI":"10.1016\/0304-3975(88)90051-5"},{"key":"R2","unstructured":"2. ANISIMOV A. V., Group languages, Kibernetika, 1971, 4, pp. 18-24.3019810241.68034"},{"key":"R3","unstructured":"3. ANISIMOV A. V. and SEIFERT F. D., Zur algebraischen Charakteristik der durch kontextfreie Sprachen definierten Gruppen, Elektr. Inf. und Kybernetik, 1975, 11, pp. 695-702.4224360322.68047"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. AUTEBERT J. M., BOASSON L. and S\u00c9NIZERGUES , Groups and NTS languages, J. Comput. Syst. Sci., 1987, 35, pp. 243-267.9102150626.68056","DOI":"10.1016\/0022-0000(87)90015-8"},{"key":"R5","unstructured":"5. BENOIS M., Parties rationnelles du groupe libre, C.R. Acad. Sci. Paris, 1969, S\u00e9ries A, 269, pp. 1188-1190.2654960214.03903"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. BERSTEL J., Tranductions and context-free languages, Teubner, 1979.5494810424.68040","DOI":"10.1007\/978-3-663-09367-1"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. BERSTEL J. and SAKAROVITCH J., Recent results in the theory of rational sets, Springer L.N.C.S., 1986, 233, pp. 15-28.8745860618.68070","DOI":"10.1007\/BFb0016231"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. BOOK R., JANTZEN M. and WRATHALL C., Monadic Thue Systems, Theoret. Comput. Sci., 1982, 19, pp. 231-251.6718690488.03020","DOI":"10.1016\/0304-3975(82)90036-6"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"9. v. BRAUNM\u00dcHL B. and HOTZEL E., Supercounter machines, Springer L.N.C.S., 1979, 71, pp. 58-72.0413.68047","DOI":"10.1007\/3-540-09510-1_6"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"10. BURNS R. G., A note on free groups, Proc. Amer. Math. Soc., 1969, 23, pp. 14-17.2524880184.04001","DOI":"10.1090\/S0002-9939-1969-0252488-X"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"11. DUNWOODY M. J., The accessibility of finitely presented groups, Invent. Math., 1985, 81, pp. 449-457.1432678070660572.20025","DOI":"10.1007\/BF01388581"},{"key":"R12","unstructured":"12. EILENBERG S., Automata, languages, and machines, Vol. A, Academic Press, 1974.5303820317.94045"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"13. FROUGNY C., SAKAROVITCH J. and SCHUPP P., Finiteness conditions on subgroups and formal languages theory, Proc. London Math. Soc., 1989, 58, pp. 74-88.9695480674.20018","DOI":"10.1112\/plms\/s3-58.1.74"},{"key":"R14","unstructured":"14. GINSBURG S., The mathematical theory of context-free languages, McGraw-Hill, New York, 1966.2118150184.28401"},{"key":"R15","unstructured":"15. HARING-SMITH R. H., Groups and simple languages, Ph. D. thesis, University of Illinois, Urbana, 1981.0518.200302631708"},{"key":"R16","unstructured":"16. HOPCROFT J. E. and ULLMAN J. D., Introduction to automata theory, languages, and computation, Addison-Wesley, 1979.6455390426.68001"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"17. JANTZEN M., KUDLEK M., LANGE K. and PETERSEN H., Dyck1-reductions of context-free languages, Springer L.N.C.S., 1987, 278, pp. 218-227.0642.68134","DOI":"10.1007\/3-540-18740-5_45"},{"key":"R18","unstructured":"18. MAGNUS W., KARRASS A. and SOLITAR D., Combinatorial group theory, Pure and Appl. Math., XII, Interscience publishers 1966.0138.25604"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"19. MULLER D. E. and SCHUPP P., Groups, the theory of ends, and context-free languages, J. Comput. System. Sci., 1983, 26, pp. 295-310.7102500537.20011","DOI":"10.1016\/0022-0000(83)90003-X"},{"key":"R20","unstructured":"20. PERROT J. F., Introduction aux mono\u00efdes syntactiques des langages alg\u00e9briques, in J.-P. CRESTIN and M. NIVAT Eds., Actes des premi\u00e8res journ\u00e9es d'informatique th\u00e9orique, Bonascre 1973, E.N.S.T.A., Paris, 1978, pp. 167-222.5197950392.20047"},{"key":"R21","unstructured":"21. SAKAROVITCH J., Mono\u00efdes syntactiques et langages alg\u00e9briques, Th\u00e8se 3e cycle, Universit\u00e9 Paris-VII, 1976.0362.68108"},{"key":"R22","unstructured":"22. SAKAROVITCH J., Syntaxe des langages de Chomsky, Th\u00e8se Sc. Math., Univ. Paris-VII, 1979."},{"key":"R23","doi-asserted-by":"crossref","unstructured":"23. SAKAROVITCH J., Sur une propri\u00e9t\u00e9 d'it\u00e9ration des langages alg\u00e9briques d\u00e9terministres, Math. Systems Theory, 1981, 14, pp. 247-288.6221550472.68042","DOI":"10.1007\/BF01752401"},{"key":"R24","doi-asserted-by":"crossref","unstructured":"24. STEARNS R. E., A regularity test for pushdown machines, Inform. and Control, 1967, 11, pp. 323-340.0155.01901","DOI":"10.1016\/S0019-9958(67)90591-8"},{"key":"R25","doi-asserted-by":"crossref","unstructured":"25. VALIANT L., Regularity and related problems for deterministic pushdown automata, J. Assoc. Comput. Math., 1975, 22, pp. 1-10.6900830293.68046","DOI":"10.1145\/321864.321865"},{"key":"R26","unstructured":"26. VALKEMA E., Zur Charakterisierung formaler Sprachen durch Halbgruppen, Dissertation, Universit\u00e4t Kiel, 1974."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1991250302551\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T05:55:26Z","timestamp":1568786126000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1991250302551"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"references-count":26,"journal-issue":{"issue":"3"},"alternative-id":["ita1991250302551"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1991250302551","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991]]}}}