Conjunctive grammars, cellular automata and logic - GREYC amacc Access content directly
Preprints, Working Papers, ... Year : 2021

Conjunctive grammars, cellular automata and logic

Abstract

The expressive power of the class Conj of conjunctive languages, i.e. languages generated by the conjunctive grammars of Okhotin, is largely unknown, while its restriction LinConj to linear conjunctive grammars equals the class of languages recognized by real-time one-way one-dimensional cellular automata. We prove two weakened versions of the open question Conj ⊆? RealTimeCA: 1) it is true for unary languages; 2) Conj ⊆ RealTime2OCA, i.e. any conjunctive language is recognized by a real-time one-way two-dimensional cellular automaton. Interestingly, we express the rules of a conjunctive grammar in two Horn logics, which exactly characterize the complexity classes RealTimeCA and RealTime2OCA.
Fichier principal
Vignette du fichier
main.pdf (683.65 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03167529 , version 1 (12-03-2021)
hal-03167529 , version 2 (09-11-2022)

Identifiers

  • HAL Id : hal-03167529 , version 1

Cite

Théo Grente, Etienne Grandjean. Conjunctive grammars, cellular automata and logic. 2021. ⟨hal-03167529v1⟩
124 View
100 Download

Share

Gmail Facebook X LinkedIn More