Classes of Languages Generated by the Kleene Star of a Word

Tools

Daviaud, Laure and Paperman, Charles (2015) Classes of Languages Generated by the Kleene Star of a Word. In: MFCS 2015: Mathematical Foundations of Computer Science 2015. Lecture Notes in Computer Science . Springer-Verlag Berlin Heidelberg, ITA, pp. 167-178. ISBN 978-3-662-48056-4

Full text not available from this repository.

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.

Item Type:	Book Section
Additional Information:	Funding Information: The second author is supported by WCMCS. Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2015.
Uncontrolled Keywords:	theoretical computer science,computer science(all) ,/dk/atira/pure/subjectarea/asjc/2600/2614
Related URLs:	http://www.scopus.com/inward/record.url?...
Depositing User:	LivePure Connector
Date Deposited:	08 Jun 2023 13:30
Last Modified:	07 Sep 2024 15:30
URI:	https://ueaeprints.uea.ac.uk/id/eprint/92328
DOI:	10.1007/978-3-662-48057-1_13

Actions (login required)

View Item