Operations Preserving Recognizable Languages

Given a strictly increasing sequence s of non-negative integers, filtering a word a_0a_1 ... a_n by s consists in deleting the letters ai such that i is not in the set {s_0, s_1, ...}. By a natural generalization, denote by L[s], where L is a language, the set of all words of L filtered by s. The filtering problem is to characterize the filters s such that, for every regular language L, L[s] is regular. In this paper, the filtering problem is solved, and a unified approach is provided to solve similar questions, including the removal problem considered by Seiferas and McNaughton. Our approach relies on a detailed study of various residual notions, notably residually ultimately periodic sequences and residually rational transductions.

[1]  Richard Edwin Stearns,et al.  Regularity Preserving Modifications of Regular Expressions , 1963, Inf. Control..

[2]  Jorge Almeida,et al.  Finite Semigroups and Universal Algebra , 1995 .

[3]  Jacques Sakarovitch,et al.  Some operations and transductions that preserve rationality , 1983, Theoretical Computer Science.

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

[5]  Olivier Carton,et al.  The Monadic Theory of Morphic Infinite Words and Generalizations , 2000, Inf. Comput..

[6]  Guo-qiang Zhang.  Periodic Functions for Finite Semigroups , 1998 .

[7]  Joel I. Seiferas.  A note on prefixes of regular languages , 1974, SIGA.

[8]  Dexter Kozen,et al.  On Regularity-Preserving Functions , 1995, Bull. EATCS.

[9]  S. Rao Kosaraju.  Correction to "Regularity preserving functions" , 1974, SIGA.

[10]  D. Siefkes.  Undecidable Extensions of Monadic Second Order Successor Arithmetic , 1971 .

[11]  Robert McNaughton,et al.  Regularity-Preserving Relations , 1976, Theor. Comput. Sci..

[12]  D. Siefkes.  Büchi's monadic second order successor arithmetic , 1970 .

[13]  J. Sakarovitch.  Eléments de théorie des automates , 2003 .

[14]  Panos M. Pardalos,et al.  A Collection of Test Problems for Constrained Global Optimization Algorithms , 1990, Lecture Notes in Computer Science.

[15]  J. Conway.  Regular algebra and finite machines , 1971 .

[16]  Mogens Nielsen,et al.  Mathematical Foundations of Computer Science 2000 , 2001, Lecture Notes in Computer Science.

[17]  Jacques Sakarovitch,et al.  Une Application de la Representation Matricielle des Transductions , 1985, Theor. Comput. Sci..

[18]  Seymour Ginsburg,et al.  The mathematical theory of context free languages , 1966 .

[19]  Guo-Qiang Zhang,et al.  Automata, Boolean Matrices, and Ultimate Periodicity , 1999, Inf. Comput..

[20]  S. Rao Kosaraju.  Context-free preserving functions , 2005, Mathematical systems theory.

[21]  Jacques Sakarovitch,et al.  Some operations and transductions that preserve rationality , 1983 .