Skip to main content Accessibility help
×
Home
Hostname: page-component-5d6d958fb5-ls6xp Total loading time: 0.18 Render date: 2022-11-27T11:23:00.934Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "displayNetworkTab": true, "displayNetworkMapGraph": false, "useSa": true } hasContentIssue true

On Varieties of Literally Idempotent Languages

Published online by Cambridge University Press:  03 June 2008

Ondřej Klíma
Affiliation:
Department of Mathematics, Masaryk University, Janáčkovo nám 2a, 662 95 Brno, Czech Republic; polak@math.muni.cz
Libor Polák
Affiliation:
Department of Mathematics, Masaryk University, Janáčkovo nám 2a, 662 95 Brno, Czech Republic; polak@math.muni.cz
Get access

Abstract

A language L ⊆A* is literally idempotent in case that ua2v ∈ L if and only if uav ∈ L, for each u,v ∈ A*, a ∈ A. Varieties of literally idempotent languages result naturally by taking all literally idempotent languages in a classical (positive) variety or by considering a certain closure operator on classes of languages. We initiate the systematic study of such varieties. Various classes of literally idempotent languages can be characterized using syntactic methods. A starting example is the class of all finite unions of $B^*_1 B^*_2\dots B^*_k$ where B1,...,Bk are subsets of a given alphabet A.

Type
Research Article
Copyright
© EDP Sciences, 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

J. Almeida, Finite Semigroups and Universal Algebra. World Scientific (1994).
Cohen, J., Pin, J.-E. and Perrin, D., On the expressive power of temporal logic. J. Comput. System Sci. 46 (1993) 271294. CrossRef
Ésik, Z., Extended temporal logic on finite words and wreath product of monoids with distinguished generators, Proc. DLT 02. Lect. Notes Comput. Sci. 2450 (2003) 4358. CrossRef
Ésik, Z. and Ito, M., Temporal logic with cyclic counting and the degree of aperiodicity of finite automata. Acta Cybernetica 16 (2003) 128.
Ésik, Z. and Larsen, K.G., Regular languages defined by Lindström quantifiers. RAIRO-Theor. Inf. Appl. 37 (2003) 197242.
Kučera, A. and Strejček, J., The stuttering principle revisited. Acta Informatica 41 (2005) 415434.
Kunc, M., Equationaltion of pseudovarieties of homomorphisms. RAIRO-Theor. Inf. Appl. 37 (2003) 243254. CrossRef
Peled, D. and Wilke, T., Stutter-invariant temporal properties are expressible without the next-time operator. Inform. Process. Lett. 63 (1997) 243246. CrossRef
J.-E. Pin, Varieties of Formal Languages. Plenum (1986).
J.-E. Pin, Syntactic semigroups, Chapter 10 in Handbook of Formal Languages, edited by G. Rozenberg and A. Salomaa, Springer (1997).
H. Straubing, On logical descriptions of recognizable languages, Proc. Latin 2002. Lecture Notes Comput. Sci. 2286 (2002) 528–538.
Thérien, D. and Wilke, T., Nesting until and since in linear temporal logic. Theor. Comput. Syst. 37 (2003) 111131. CrossRef
S. Yu, Regular languages, Chapter 2 in Handbook of Formal Languages, edited by G. Rozenberg and A. Salomaa, Springer (1997).

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

On Varieties of Literally Idempotent Languages
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

On Varieties of Literally Idempotent Languages
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

On Varieties of Literally Idempotent Languages
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *