Noncommutative minimization algorithms

DOI10.1016/S0020-0190(97)00162-2zbMath1337.68173MaRDI QIDQ287255

E. Laugerotte, Marianne Flouret

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

automataminimizationformal languagesintertwiningnoncommutative fieldsrational series

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items (5)

Coalgebras for Bisimulation of Weighted Automata over Semirings ⋮ Weighted Bisimulation in Linear Algebraic Form ⋮ Rational and Recognisable Power Series ⋮ Direct and dual laws for automata with multiplicities ⋮ A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrices de Hankel
• A rationality criterion coming from noncommutative geometry
• On the definition of a family of automata

This page was built for publication: Noncommutative minimization algorithms