DLT 2005: Developments in Language Theory pp 69-77 | Cite as
Inexpressibility Results for Regular Languages in Nonregular Settings
Abstract
My ostensible purpose in this talk is to describe some new results (found in collaboration with Amitabha Roy) on expressibility of regular languages in certain generalizations of first-order logic. [10]. This provides me with a good excuse for describing some the work on the algebraic theory of regular languages in what one might call “nonregular settings”.
The syntactic monoid and syntactic morphism of a regular language provide a highly effective tool for proving that a given regular language is not expressible or recognizable in certain compuational models, as long as the model is guaranteed to produce only regular languages. This includes finite automata, of course. but also formulas of propositional temporal logic, and first-order logic, provided one is careful to restrict the expressive power of such logics. (For example, by only allowing the order relation in first-order formulas.)
Things become much harder, and quite a bit more interesting, when we drop this kind of restriction on the model. The questions that arise are important (particularly in computational complexity), and most of them are unsolved. They all point to a rich theory that extends the reach of algebraic methods beyond the domain of finite automata
Keywords
Solvable Group Regular Language Predicate Symbol Relation Symbol Presburger ArithmeticPreview
Unable to display preview. Download preview PDF.
References
- 1.Mix Barrington, D.: Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC1. J. Comp. Syst. Sci. 38, 150–164 (1989)CrossRefGoogle Scholar
- 2.Mix Barrington, D., Compton, K., Straubing, H., Thérien, D.: Regular Languages in NC1. J. Comp. Syst. Sci. 44, 478–499 (1992)MATHCrossRefGoogle Scholar
- 3.Mix Barrington, D., Immerman, N., Straubing, H.: On Uniformity in NC1. J. Comp. Syst. Sci. 41, 274–306 (1990)MATHCrossRefGoogle Scholar
- 4.Barrington, D.M., Immerman, N., Lautemann, C., Schweikardt, N., Thérien, D.: The Crane Beach Conjecture. In: LICS 2001, pp. 187–196 (2001)Google Scholar
- 5.Mix Barrington, D., Straubing, H.: Superlinear Lower Bounds for Bounded- Width Branching Programs. J. Comp. Syst. Sci. 50, 374–381 (1995)MATHCrossRefGoogle Scholar
- 6.Mix Barrington, D., Thérien, D.: Finite Monoids and the Fine Structure of NC1. JACM 35, 941–952 (1988)CrossRefGoogle Scholar
- 7.Furst, M., Saxe, J., Sipser, M.: Parity, Circuits and the Polynomial-time Hierarchy. Math. Systems Theory 17, 13–27 (1984)MATHCrossRefMathSciNetGoogle Scholar
- 8.Libkin, L.: Embedded finite models and constraint databases. In: Grädel, E., et al. (eds.) Finite Model Theory and its Applications. Springer, New York (2005)Google Scholar
- 9.Presburger, M.: Ueber die Vollstaendigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In: Comptes Rendus du I congrés de Mathématiciens des Pays Slaves, pp. 92–101. Warsaw, Poland (1929)Google Scholar
- 10.Roy, A., Straubing, H.: Definability of Languages by Generalized First-ordr Formulas over (N,+) (preprint)Google Scholar
- 11.Circuit complexity and the expressive power of generalized first-order formulas. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 16–27. Springer, Heidelberg (1992)Google Scholar
- 12.Straubing, H.: Languages defined with modular counting quantifiers. Inform. and Comput. 166, 112–132 (2001)MATHCrossRefMathSciNetGoogle Scholar
- 13.Straubing, H., Thérien, D., Thomas, W.: Regular Languages Defined with Generalized Quantifiers. Information and Computation 118, 289–301 (1995)MATHCrossRefMathSciNetGoogle Scholar