City Research Online

Daviaud, L. & Paperman, C. (2015). Classes of Languages Generated by the Kleene Star of a Word. In: Italiano, G., Pughizzini, G. & Sannella, D. (Eds.), Mathematical Foundations of Computer Science 2015. MFCS 2015. 40th International Symposium on Mathematical Foundations of Computer Science (MFCS), 24 - 28 Aug 2015, Milan, Italy. doi: 10.1007/978-3-662-48057-1_13

Abstract

In this paper, we study the lattice and the Boolean algebra, possibly closed under quotient, generated by the languages of the form u∗, where u is a word. We provide effective equational characterisations of these classes, i.e. one can decide using our descriptions whether a given regular language belongs or not to each of them.

Publication Type:	Conference or Workshop Item (Paper)
Publisher Keywords:	Normal Form, Boolean Algebra, Regular Language, Finite Union, Finite Intersection
Departments:	School of Science & Technology > Computer Science

Preview

Text - Accepted Version
Download (382kB) | Preview

Official URL: https://doi.org/10.1007/978-3-662-48057-1_13

Export

RefWorks RDF+XML BibTeX RIOXX2 XML RDF+N-Triples JSON Dublin Core Dublin Core Atom Simple Metadata Refer METS HTML Citation ASCII Citation OpenURL ContextObject EndNote OpenURL ContextObject in Span MODS MPEG-21 DIDL EP3 XML Reference Manager RDF+N3 Multiline CSV

Downloads

Downloads per month over past year

View more statistics