Unresolved systems of language equations: Expressive power and decision problems

Unresolved language equations and inequalities with various sets of operations are considered. It is proved that systems of unresolved equations with linear concatenation and union only, as well as systems with linear concatenation and intersection only, are as expressive as the more general unresolved inequalities with all Boolean operations and unrestricted concatenation: the class of languages defined by unique (least, greatest) solutions of these systems is shown to coincide with the families of recursive (RE, co-RE, resp.) sets, which result extends even to individual equations of the form ∪ujXijvj = w∪∪yjXtjzj. On the other hand, unresolved equations with different sets of operations are shown to differ in the hardness of their decision problems, and it is demonstrated that several types of unresolved equations cannot effectively simulate each other in spite of the equality of the language families they define.

[1]  Paliath Narendran,et al.  Unification of Concept Terms in Description Logics , 2001, Description Logics.

[2]  Ralf Küsters,et al.  Unification in a Description Logic with Transitive Closure of Roles , 2001, LPAR.

[3]  Lila Kari,et al.  Maximal and Minimal Solutions to Language Equations , 1996, J. Comput. Syst. Sci..

[4]  Guo-Qiang Zhang,et al.  Domain µ-calculus , 2003, RAIRO Theor. Informatics Appl..

[5]  Jean Berstel,et al.  Context-Free Languages and Pushdown Automata , 1997, Handbook of Formal Languages.

[6]  P. Cousot,et al.  Constructive versions of tarski's fixed point theorems , 1979 .

[7]  Alexander Okhotin.  Conjunctive Grammars and Systems of Language Equations , 2004, Programming and Computer Software.

[8]  Mustapha Arfi.  Polynomial operations and hierarchies of concatenation (in French) , 1991 .

[9]  Jean-Éric Pin,et al.  Syntactic Semigroups , 1997, Handbook of Formal Languages.

[10]  Alexander Okhotin,et al.  On the equivalence of linear conjunctive grammars and trellis automata , 2004, RAIRO Theor. Informatics Appl..

[11]  Alexander Okhotin.  Decision Problems for Language Equations with Boolean Operations , 2003, ICALP.

[12]  Arto Salomaa,et al.  Systolic trellis automatat , 1984 .

[13]  Ernst L. Leiss,et al.  On Equations for Regular Languages, Finite Automata, and Sequential Networks , 1980, Theor. Comput. Sci..

[14]  I. N. Sneddon,et al.  Theory Of Automata , 1969 .

[15]  Alexander Okhotin,et al.  Conjunctive Grammars , 2001, J. Autom. Lang. Comb..

[16]  Michal Kunc.  The Power of Commuting with Finite Sets of Words , 2005, STACS.

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

[18]  M. Rabin.  Decidability of second-order theories and automata on infinite trees. , 1969 .

[19]  Ion Petre,et al.  Conway's problem for three-word sets , 2002, Theor. Comput. Sci..

[20]  Brenda S. Baker,et al.  Reversal-Bounded Multipushdown Machines , 1974, J. Comput. Syst. Sci..

[21]  Seymour Ginsburg,et al.  Two Families of Languages Related to ALGOL , 1962, JACM.

[22]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[23]  Alexander Okhotin.  Boolean grammars , 2004, Inf. Comput..