Boolean algebras by length recognizability - Archive ouverte HAL Access content directly
Book Sections Year : 2019

Boolean algebras by length recognizability

Didier Caucal
Chloé Rispal


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.
Fichier principal
Vignette du fichier
Submitted.pdf (264.64 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02012291 , version 1 (08-02-2019)



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⟩
72 View
119 Download



Gmail Facebook Twitter LinkedIn More