Noncommutative minimization algorithms

DOI10.1016/S0020-0190(97)00162-2zbMATH Open1337.68173MaRDI QIDQ287255FDOQ287255

Authors: E. Laugerotte, Marianne Flouret 

Publication date: 26 May 2016

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

Recommendations

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

zbMATH Keywords

minimizationautomataformal languagesintertwiningnoncommutative fieldsrational series

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Matrices de Hankel
• A rationality criterion coming from noncommutative geometry
• On the definition of a family of automata
• Title not available (Why is that?)

Cited In (5)

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

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)