 |
HAL UPEC - UPEM Portal |  |
 |
Book sections
Boolean algebras by length recognizability
Abstract : We present a simple approach to define Boolean algebras on languages. We proceed by inverse deterministic and length-preserving morphisms on automata whose vertices are words. We give applications for context-free languages and context-sensitive languages.
Cited literature [9 references]
https://hal-upec-upem.archives-ouvertes.fr/hal-02012291
Contributor : Didier Caucal Connect in order to contact the contributor
Submitted on : Friday, February 8, 2019 - 4:09:10 PM
Last modification on : Wednesday, October 27, 2021 - 12:57:28 PM
Long-term archiving on: : Thursday, May 9, 2019 - 3:31:19 PM
Contributor : Didier Caucal Connect in order to contact the contributor
Submitted on : Friday, February 8, 2019 - 4:09:10 PM
Last modification on : Wednesday, October 27, 2021 - 12:57:28 PM
Long-term archiving on: : Thursday, May 9, 2019 - 3:31:19 PM
File
Submitted.pdf
Files produced by the author(s)