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 double-struck T-automaton, where double-struck 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 double-struck 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. © 2014 IFIP International Federation for Information Processing.
CITATION STYLE
Goncharov, S., Milius, S., & Silva, A. (2014). Towards a coalgebraic Chomsky hierarchy (extended abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8705 LNCS, pp. 265–280). Springer Verlag. https://doi.org/10.1007/978-3-662-44602-7_21
Mendeley helps you to discover research relevant for your work.