Unrestricted complementation in language equations over a one-letter alphabet

AbstractRecently, the complete solution of systems of language equations over a one-letter alphabet has been derived where the operators are union, concatenation and star. This paper addresses the question of adding the complementation operator. It is known that if no stars are present and if the concatenation operator is restricted, such equations need not have solutions, but if they do, they can be solved explicitly if the constants are regular in which case the solutions are also regular. In this paper we study language equations over a one-letter alphabet where unrestricted concatenation interacts with complementation, union, and star. We define a procedure for determining a regular solution of the general type of equation assuming that all constants are regular, discuss its properties, and show examples. We then prove that in general equations with complementation and complementation and concatenation in which all constants are regular may have nonregular solutions. This shows that language equations can be used to obtain non-context-free languages from regular languages using only operators under which the regular languages are closed

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS'09)

The Symposium on Theoretical Aspects of Computer Science (STACS) is held alternately in France and in Germany. The conference of February 26-28, 2009, held in Freiburg, is the 26th in this series. Previous meetings took place in Paris (1984), Saarbr¨ucken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992), W¨urzburg (1993), Caen (1994), M¨unchen (1995), Grenoble (1996), L¨ubeck (1997), Paris (1998), Trier (1999), Lille (2000), Dresden (2001), Antibes (2002), Berlin (2003), Montpellier (2004), Stuttgart (2005), Marseille (2006), Aachen (2007), and Bordeaux (2008). ..