Coalgebraic constructions of canonical nondeterministic automata
From MaRDI portal
Publication:890382
DOI10.1016/j.tcs.2015.03.035zbMath1380.68290OpenAlexW1992050455MaRDI QIDQ890382
Stefan Milius, Jiří Adámek, Robert S. R. Myers, Henning Urbat
Publication date: 10 November 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.03.035
Related Items
A (co)algebraic theory of succinct automata, Unnamed Item, Nondeterministic syntactic complexity, Coalgebraic minimization of automata by initiality and finality, Nondeterministic fuzzy automata with membership values in complete residuated lattices, Duality of Equations and Coequations via Contravariant Adjunctions, Unnamed Item, Unnamed Item, Profinite Monads, Profinite Equations, and Reiterman’s Theorem, Schützenberger Products in a Category, Yet another canonical nondeterministic automaton
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On continuous nondeterminism and state minimality
- A coalgebraic perspective on linear weighted automata
- On varieties of meet automata
- Terminal coalgebras in well-founded set theory
- Well-Pointed Coalgebras
- A Coalgebraic Perspective on Minimization and Determinization
- Brzozowski’s Algorithm (Co)Algebraically
- Trace Semantics via Determinization
- Minimization via Duality
- Categories of Algebraic Contexts Equivalent to Idempotent Semirings and Domain Semirings
- Canonical Nondeterministic Automata
- Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
- Iterative algebras at work
- Generalizing determinization from automata to coalgebras
- Theory of Átomata
- Generalized Eilenberg Theorem I: Local Varieties of Languages
- Generic Trace Semantics via Coinduction
- A logical calculus of the ideas immanent in nervous activity
