Boolean algebras by length recognizability

Didier Caucal 1 Chloé Rispal 1
1 LIGM - Laboratoire d'Informatique Gaspard-Monge
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.
Keywords : superposition boolean algebras synchronization context-free languages
Document type :
Book sections
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 : Wednesday, October 30, 2019 - 1:32:04 AM
Long-term archiving on: Thursday, May 9, 2019 - 3:31:19 PM

File

Submitted.pdf
Files produced by the author(s)

Identifiers

Collections

ENPC | UPEC-UPEM | CNRS | PARISTECH | LIGM

Citation

Didier Caucal, Chloé Rispal. Boolean algebras by length recognizability. Lecture Notes in Computer Science, 11200, Springer, pp.169-185, 2019, Models, Mindsets, Meta: The What, the How, and the Why Not?, ⟨10.1007/978-3-030-22348-9_11⟩. ⟨hal-02012291⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

72

Files downloads

100

Contact

CCSD