Towards a Coalgebraic Chomsky Hierarchy - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Towards a Coalgebraic Chomsky Hierarchy


The Chomsky hierarchy plays a prominent role in the foundations of theoretical computer science relating classes of formal languages of primary importance. In this paper we use recent developments on coalgebraic and monad-based semantics to obtain a generic notion of a $\mathbb{T}$-automaton, where $\mathbb{T}$ is a monad, which allows the uniform study of various notions of machines (e.g. finite state machines, multi-stack machines, Turing machines, weighted automata). We use the generalized powerset construction to define a generic (trace) semantics for $\mathbb{T}$-automata, and we show by numerous examples that it correctly instantiates for some known classes of machines/languages captured by the Chomsky hierarchy. Moreover, our approach provides new generic techniques for studying expressivity power of various machine-based models.
Fichier principal
Vignette du fichier
978-3-662-44602-7_21_Chapter.pdf (379.17 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01402071 , version 1 (24-11-2016)





Sergey Goncharov, Stefan Milius, Alexandra Silva. Towards a Coalgebraic Chomsky Hierarchy. 8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.265-280, ⟨10.1007/978-3-662-44602-7_21⟩. ⟨hal-01402071⟩
82 View
99 Download



Gmail Facebook Twitter LinkedIn More