Rational transductions and complexity of counting problems

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 us 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 belongs to a fixed language. Other results concern a suboptimal compression of finitely ambiguous context-free 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 ranking functions.

[1]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[2]  Alberto Bertoni,et al.  The Complexity of Computing the Number of Strings of Given Length in Context-Free Languages , 1991, Theor. Comput. Sci..

[3]  Dung T. Huynh,et al.  Effective Entropies and Data Compression , 1991, Inf. Comput..

[4]  V Vinay.  Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[5]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[6]  Arto Salomaa,et al.  Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.

[7]  Donald F. Stanat,et al.  A Homomorphism Theorem for Weighted Context-Free Grammars , 1972, J. Comput. Syst. Sci..

[8]  Jay Earley,et al.  An efficient context-free parsing algorithm , 1970, Commun. ACM.

[9]  Andrew V. Goldberg,et al.  Compression and Ranking , 1991, SIAM J. Comput..

[10]  Stephen A. Cook,et al.  A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..

[11]  Jay Earley,et al.  An efficient context-free parsing algorithm , 1970, Commun. ACM.

[12]  Alberto Bertoni,et al.  Ranking and Formal Power Series , 1991, Theor. Comput. Sci..

[13]  Jean Berstel,et al.  Rational series and their languages , 1988, EATCS monographs on theoretical computer science.

[14]  Dung T. Huynh.  The complexity of ranking simple languages , 2005, Mathematical systems theory.

[15]  Carme Àlvarez,et al.  A very hard log space counting class , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[16]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[17]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[18]  Philippe Flajolet,et al.  Analytic Models and Ambiguity of Context-free Languages* , 2022 .

[19]  Joseph S. Ullian,et al.  The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages , 1966, JACM.