Tools
ToolsDaviaud, Laure and Paperman, Charles (2018) Classes of languages generated by the Kleene star of a word. Information and Computation, 262. pp. 90-109. ISSN 0890-5401
Full text not available from this repository. (Request a copy)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: | Article |
|---|---|
| Additional Information: | Funding Information: This work was carried out when the first author was supported by ANR Project ELICA ANR-14-CE25-0005 and by ANR Project RECRE ANR-11-BS02-0010 (ENS Lyon, France) and the second author by Warsaw Center of Mathematics and Computer Science (WCMCS) (Poland). |
| Uncontrolled Keywords: | automata theory,decidability,kleene star,profinite equations,regular languages,theoretical computer science,information systems,computer science applications,computational theory and mathematics ,/dk/atira/pure/subjectarea/asjc/2600/2614 |
| Faculty \ School: | Faculty of Science > School of Computing Sciences |
| UEA Research Groups: | Faculty of Science > Research Groups > Algebra, Logic & Number Theory |
| Related URLs: | |
| Depositing User: | LivePure Connector |
| Date Deposited: | 07 Jun 2023 13:30 |
| Last Modified: | 11 Nov 2024 09:30 |
| URI: | https://ueaeprints.uea.ac.uk/id/eprint/92316 |
| DOI: | 10.1016/j.ic.2018.07.002 |
Actions (login required)
 |
View Item |