Abstract
This work presents an algebraic method based on rational transductions to study the sequential and parallel complexity of counting problems for regular and context-free languages. This approach allows to obtain old and new results on the complexity of ranking and unranking as well as on other problems concerning the number of prefixes, suffixes, subwords and factors of a word which belong to a fixed language. Other results concern a suboptimal compression of finitely ambiguous c.f. languages, the complexity of the value problem for rational and algebraic formal series in noncommuting variables and a characterization of regular and Z-algebraic languages by means of rank functions.
This research was supported by ESPRIT Working Group ASMICS (CEC contract n.3166), PRC Mathématiques et Informatique, MURST Project 40% “Algoritmi, modelli di calcolo e strutture informative”.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A.V. Aho, J.E. Hopcroft and J.D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, Reading Mass. 1974.
C. Alvarez and B. Jenner, “A very hard log space counting class”, Proceedings 5th Conference on Structure in Complexity Theory (1990), 154–168.
J. Berstel, Transductions and context-free languages, Teubner, Stuttgart, 1979.
A. Bertoni, D. Bruschi and M. Goldwurm, “Ranking and formal power series”, Theoretical Computer Science 79 (1991) 25–35.
A. Bertoni, M. Goldwurm and N. Sabadini, “The complexity of computing the number of strings of given length in context-free languages”, Theoretical Computer Science 86 (1991), 325–342.
M. Bogni, Algoritmi per il problema del valore di serie formali a variabili non commutative, Degree Thesis in Mathematics, Dip. Scienze dell'Informazione, Università di Milano, June 1991.
S.A. Cook, “A taxonomy of problems with fast parallel algorithms,” Inform. and Control 64 (1985), 2–22.
J. Earley, “An efficient context-free parsing algorithm”, Communications of the ACM 13 n.2 (1970),94–102.
P. Flajolet, “Analytic models and ambiguity of context-free languages”, Theoretical Computer Science 49 (1987), 283–309.
A.V. Goldberg and M. Sipser, “Compression and ranking”, Proceedings 17th ACM Symp. on Theory of Comput. (1985), 59–68.
M. Harrison, Introduction to formal language theory, Addison-Wesley, Reading Mass., 1978.
D.T. Huynh, “The complexity of ranking simple languages”, Math. Systems Theory 23 (1990), 1–20.
D.T. Huynh, “Effective entropies and data compression”, Information and Computation 90 (1991),67–85.
A. Salomaa and M. Soittola, Automata theoretic aspects of formal power series, Springer Verlag, Berlin 1978.
D.F. Stanat, “A homomorphism theorem for weighted context-free grammar”, J. Comput. System Sci. 6 (1972), 217–232.
L.G. Valiant, “The complexity of enumeration and reliability problems”, SIAM J. Comput. 8 (1979), 410–420.
V. Vinaj, “Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits”, Proc. 6th Conference on Structure in Complexity Theory (1991), 270–284.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Choffrut, C., Goldwurm, M. (1992). Rational transductions and complexity of counting problems. In: Havel, I.M., Koubek, V. (eds) Mathematical Foundations of Computer Science 1992. MFCS 1992. Lecture Notes in Computer Science, vol 629. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-55808-X_16
Download citation
DOI: https://doi.org/10.1007/3-540-55808-X_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55808-8
Online ISBN: 978-3-540-47291-9
eBook Packages: Springer Book Archive