Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata

DOI10.1007/978-3-662-44602-7_24zbMath1398.68352OpenAlexW323768384MaRDI QIDQ3190170

Barbara König, Sebastian Küpper

Publication date: 15 September 2014

Published in: Advanced Information Systems Engineering (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01402080/file/978-3-662-44602-7_24_Chapter.pdf

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items (8)

Minimality Notions via Factorization Systems and Examples ⋮ Unnamed Item ⋮ A (co)algebraic theory of succinct automata ⋮ Unnamed Item ⋮ Coalgebraic minimization of automata by initiality and finality ⋮ A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata ⋮ Efficient Coalgebraic Partition Refinement ⋮ Unnamed Item

This page was built for publication: Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata