RAIRO-Theor. Inf. Appl.
Volume 37, Number 3, July-September 2003
|Page(s)||179 - 241|
|Published online||15 November 2003|
Regular languages definable by Lindström quantifiers
Dept. of Computer Science,
University of Szeged,
6701 Szeged, Hungary; firstname.lastname@example.org.
2 Dept. of Computer Science, Aalborg University, Fredrik Bajers Vej 7E, 9220 Aalborg, Denmark; email@example.com.
Accepted: August 2003
In our main result, we establish a formal connection between Lindström quantifiers with respect to regular languages and the double semidirect product of finite monoids with a distinguished set of generators. We use this correspondence to characterize the expressive power of Lindström quantifiers associated with a class of regular languages.
Mathematics Subject Classification: 20M35 / 68Q45 / 68Q60 / 68Q70
Key words: Regular language / logic / Lindström quantifier / expressive power / semidirect product.
© EDP Sciences, 2003
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.