Noncommutative minimization algorithms

DOI10.1016/S0020-0190(97)00162-2MaRDI QIDQ287255zbMATH OpenFDO

Authors E. Laugerotte, Marianne Flouret

Publication date 26 May 2016

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

zbMATH Keywords

minimizationautomataformal languagesintertwiningnoncommutative fieldsrational series

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Recommendations

• Noncommutative rational series with applications
• scientific article; zbMATH DE number 5722801
• Rational relations and rational series
• Minimization of Rational Word Functions
• Computation, on Macsyma, of the minimal differential representation of noncommutative polynomials

Cites work

• scientific article; zbMATH DE number 41838 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 1988973 (Why is no real title available?)
• A rationality criterion coming from noncommutative geometry
• Matrices de Hankel
• On the definition of a family of automata

Cited in

(5)

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

This page was built for publication: Noncommutative minimization algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287255)