The Almost Equivalence by Asymptotic Probabilities for Regular Languages and Its Computational Complexities

We introduce p-equivalence by asymptotic probabilities, which is a weak almost-equivalence based on zero-one laws in finite model theory. In this paper, we consider the computational complexities of p-equivalence problems for regular languages and provide the following details. First, we give an robustness of p-equivalence and a logical characterization for p-equivalence. The characterization is useful to generate some algorithms for p-equivalence problems by coupling with standard results from descriptive complexity. Second, we give the computational complexities for the p-equivalence problems by the logical characterization. The computational complexities are the same as for the (fully) equivalence problems. Finally, we apply the proofs for p-equivalence to some generalized equivalences.

[1]  Ryoma Sin'ya.  An Automata Theoretic Approach to the Zero-One Law for Regular Languages: Algorithmic and Logical Aspects , 2015, GandALF.

[2]  Andrew Badr,et al.  HYPER-MINIMIZATION IN O(n2) , 2008, Int. J. Found. Comput. Sci..

[3]  James F. Lynch.  Convergence laws for random words , 1993, Australas. J Comb..

[4]  Neil Immerman,et al.  Descriptive Complexity , 1999, Graduate Texts in Computer Science.

[5]  Markus Holzer,et al.  From Equivalence to Almost-Equivalence, and Beyond - Minimizing Automata with Errors - (Extended Abstract) , 2012, Developments in Language Theory.

[6]  T. G. Szymanski,et al.  On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages , 1976, J. Comput. Syst. Sci..

[7]  Larry Joseph Stockmeyer,et al.  The complexity of decision problems in automata theory and logic , 1974 .

[8]  Albert R. Meyer,et al.  Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[9]  Neil Immerman.  Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..

[10]  Jeffrey Shallit,et al.  Characterizing Regular Languages with Polynomial Densities , 1992, MFCS.

[11]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[12]  Neil Immerman,et al.  Nondeterministic space is closed under complementation , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[13]  Neil D. Jones,et al.  Space-Bounded Reducibility among Combinatorial Problems , 1975, J. Comput. Syst. Sci..

[14]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[15]  M. Muresan.  A concrete approach to classical analysis , 2009 .

[16]  Róbert Szelepcsényi,et al.  The method of forced enumeration for nondeterministic automata , 1988, Acta Informatica.

[17]  Jacques Sakarovitch,et al.  Elements of Automata Theory , 2009 .

[18]  Antonio Restivo,et al.  Codes and Automata , 1987, Formal Properties of Finite Automata and Applications.

[19]  Leonid Libkin,et al.  Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.

[20]  Ken Thompson,et al.  Programming Techniques: Regular expression search algorithm , 1968, Commun. ACM.

[21]  Viliam Geffert,et al.  Hyper-minimizing minimized deterministic finite state automata , 2009, RAIRO Theor. Informatics Appl..

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

[23]  Jean Berstel.  Sur la densité asymptotique de langages formels , 1972, ICALP.

[24]  Ryoma Sin'ya.  Zero-One Law for Regular Languages and Semigroups with Zero , 2015, ArXiv.