2014
DOI: 10.1007/978-3-662-44602-7_21
|View full text |Cite
|
Sign up to set email alerts
|

Towards a Coalgebraic Chomsky Hierarchy

Abstract: Abstract. 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 monadbased semantics to obtain a generic notion of a T-automaton, where T is a monad, which allows the uniform study of various notions of machines (e.g. finite state machines, multi-stack machines, Turing machines, valence automata, weighted automata). We use the generalized powerset con… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
20
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
4
1

Relationship

4
1

Authors

Journals

citations
Cited by 10 publications
(20 citation statements)
references
References 43 publications
0
20
0
Order By: Relevance
“…Goncharov et al [23] show that H lifts to Set T and conclude that finite-state HT -coalgebras match the intuition of deterministic pushdown automata without spontaneous transitions. The languages accepted by those automata are precisely the real-time deterministic contextfree languages; this notion goes back to Harrison and Havel [24].…”
Section: The Behaviour Of Stack Machinesmentioning
confidence: 94%
See 4 more Smart Citations
“…Goncharov et al [23] show that H lifts to Set T and conclude that finite-state HT -coalgebras match the intuition of deterministic pushdown automata without spontaneous transitions. The languages accepted by those automata are precisely the real-time deterministic contextfree languages; this notion goes back to Harrison and Havel [24].…”
Section: The Behaviour Of Stack Machinesmentioning
confidence: 94%
“…In the non-deterministic setting, a similar property holds, namely that the determinized HT -coalgebras with finite carrier describe precisely the context-free languages [23,Theorem 6.5]. Combine this with (1):…”
Section: The Behaviour Of Stack Machinesmentioning
confidence: 96%
See 3 more Smart Citations