A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata
type: Item
instance of: scholarly article
title: A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata
zbMATH Open document ID: 1398.68353
author: Barbara König
author: Sebastian Küpper
published in: Soft Computing
publication date: 2018-10-22T00:00:00Z
Mathematics Subject Classification ID: 68Q70
zbMATH DE Number: 6960112
MaRDI profile type: Publication
full work available at URL: s00500-016-2363-z
OpenAlex ID: W2522575395
cites work: Q4293501
cites work: On the greatest fixed point of a set functor
cites work: Q4693062
cites work: A Coalgebraic Perspective on Minimization and Determinization
cites work: What’s Decidable about Weighted Automata?
cites work: Automata, Languages and Programming
cites work: Conjugacy and Equivalence of Weighted Automata and Functional Transducers
cites work: Q3994777
cites work: Q5287508
cites work: Axiomatizing rational power series over natural numbers
cites work: Q4056047
cites work: Coinduction up-to in a fibrational setting
cites work: Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
cites work: Weighted Bisimulation in Linear Algebraic Form
cites work: Minimax algebra
cites work: Handbook of weighted automata
cites work: Multi-Linear Iterative K-Σ-Semialgebras
cites work: A GENERALIZATION OF KOZEN'S AXIOMATIZATION OF THE EQUATIONAL THEORY OF THE REGULAR SETS
cites work: Free inductive \(K\)-semialgebras
cites work: Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types
cites work: Noncommutative minimization algorithms
cites work: Generic Trace Semantics via Coinduction
cites work: Q3862379
cites work: Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata
cites work: Q3975995
cites work: THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
cites work: Weighted Automata Algorithms
cites work: A complete axiom system for rational sets with multiplicity
cites work: Fuzzy Languages
cites work: Enhanced coalgebraic bisimulation
cites work: Universal coalgebra: A theory of systems
cites work: Rational and Recognisable Power Series
cites work: On the definition of a family of automata
cites work: Relating Coalgebraic Notions of Bisimulation
cites work: Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices
DOI: 10.1007/S00500-016-2363-Z
description: scientific article; zbMATH DE number 6960112