On Approximating Non-regular Languages by Regular Languages

Approximate computation is a central concept in algorithms and computation theory. Our notion of approximation is that the algorithm performs correctly on most of the inputs. We propose some finite automata models to study the question of how well a finite automaton can approximately recognize a non-regular language. On the one hand, we show that there are natural problems for which a DFA can correctly solve almost all the instances, but not all instances. An example of such a problem is a decision question about the number of digits in the square of a given integer. On the other hand, we show that some languages (such as L majority = {x ∈ (0 + 1)a | x has more 1′s than 0′s }) can't be approximated by any regular language in a strong sense. We also show that there are problems that are intermediate (between the extremes stated above) in terms of how we well a regular language can approximate it. An example of such a problem is a decision question about the number of digits in the product of two integers. We also present results comparing different models of approximation.

[1]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[2]  A. Baker.  Transcendental Number Theory , 1975 .

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

[4]  Martin Fürer,et al.  Faster integer multiplication , 2007, STOC '07.

[5]  László Babai,et al.  Random Oracles Separate PSPACE from the Polynomial-Time Hierarchy , 1987, Inf. Process. Lett..

[6]  Dawei Hong,et al.  Probabilistic Approximation of Some NP Optimization Problems by Finite-State Machines , 1997, RANDOM.

[7]  S. Muthukrishnan,et al.  Data streams: algorithms and applications , 2005, SODA '03.

[8]  Robert E. Wilber.  Randomness and the density of hard problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[9]  Martin Kappes,et al.  Succinct representations of languages by DFA with different levels of reliability , 2005, Theor. Comput. Sci..

[10]  Manuel Blum,et al.  Universal Statistical Tests , 1992, LATIN.

[11]  Kai Salomaa,et al.  On the existence of regular approximations , 2007, Theor. Comput. Sci..

[12]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[13]  Philippe Flajolet,et al.  Ambiguity and Transcendence , 1985, ICALP.

[14]  David Maier,et al.  Review of "Introduction to automata theory, languages and computation" by John E. Hopcroft and Jeffrey D. Ullman. Addison-Wesley 1979. , 1980, SIGA.

[15]  Oded Goldreich,et al.  Combinatorial property testing (a survey) , 1997, Randomization Methods in Algorithm Design.

[16]  Martin Kappes,et al.  Tradeoffs Between Reliability and Conciseness of Deterministic Finite Automata , 2004, J. Autom. Lang. Comb..

[17]  B. Ravikumar,et al.  Efficient implementation of algorithms for approximate exponentiation , 2008, Inf. Process. Lett..

[18]  Jin-Yi Cai,et al.  With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy , 1986, STOC '86.

[19]  Jin-Yi Cai,et al.  With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy , 1986, STOC '86.

[20]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[21]  Azaria Paz,et al.  Probabilistic automata , 2003 .

[22]  Helmut Hasse,et al.  Number Theory , 2020, An Introduction to Probabilistic Number Theory.