Summary
In this paper the complexity of some decision problems for finitely presented abelian groups defined by context-free grammars is investigated. We shall prove that the membership problem and the isomorphism problem are recognizable in deterministic polynomial-time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Clifford, A.H., Preston, G.B.: The algebraic theory of semigroups. A.M.S., Vol. 2, 1967
Crowell, R., Fox, R.: Introduction to knot theory. Graduate Texts in Mathematics, Springer-Verlag 1977
Havas, G., Sterling, L.S.: Integer matrices and abelian groups. In: Proc. of the Intern. Symp. on Symbolic and Algebraic Manipulation, LNCS No. 72, pp. 431–451, 1979
Hotz, G.: Eine Neue Invariante für Kontext-freie Sprachen. TCS 11, 107–116 (1980)
Hotz, G.: Verschränkte Homomorphismen formaler Sprachen. Rairo 14, 193–208 (1980)
Huynh, T.D.: The complexity of regular grammars under Parikh-mapping. Submitted for publication
Magnus, W., Karrass, A., Solitar, D.: Combinatorial group theory: Presentations of groups in terms of generators and relations. John Willey & Sons 1966
Specker, E., Strassen, V.: Komplexität von Entscheidungsproblemen. LNCS 43 (1976)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Huynh, TD. Remarks on the complexity of an invariant of context-free grammars. Acta Informatica 17, 89–99 (1982). https://doi.org/10.1007/BF00262978
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00262978