Recognizability for automata

Didier Caucal (1) , Chloé Rispal (1)

1 LIGM - Laboratoire d'Informatique Gaspard-Monge

We present a new approach to define boolean algebras of various language families : given a family F of infinite automata, an automaton H recognizes the set of languages accepted by all automata of F that can be mapped by morphism into H. Considering appropriate automata families, we get boolean algebras of context-free languages, indexed languages, Petri net languages, higher order indexed languages and context-sensitive languages.

Mots clés: Chomsky hierarchy; Boolean algebras; Recognizability

Domaines: Informatique [cs]; Théorie et langage formel [cs.FL]

Didier Caucal, Chloé Rispal. Recognizability for automata. DLT 2018, Sep 2018, Tokyo, Japan. pp.206-218, ⟨10.1007/978-3-319-98654-8_17⟩. ⟨hal-01824290⟩