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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [4 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-02012291
Contributor : Didier Caucal <>
Submitted on : Friday, February 8, 2019 - 4:09:10 PM
Last modification on : Tuesday, March 19, 2019 - 11:58:18 PM
Long-term archiving on : Thursday, May 9, 2019 - 3:31:19 PM

File

Submitted.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02012291, version 1

Collections

Citation

Didier Caucal, Chloé Rispal. Boolean algebras by length recognizability. 2019. ⟨hal-02012291⟩

Share

Metrics

Record views

52

Files downloads

56