New results on the star problem in trace monoids

DOI10.1006/inco.1995.1088zbMath0832.68074OpenAlexW1990800590MaRDI QIDQ1893738

Gwenaël Richomme, Yves Métivier

Publication date: 2 August 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1088

zbMATH Keywords

recognizable subsetrecognizable trace language

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Formal languages and automata (68Q45)

Related Items (6)

Two techniques in the area of the star problem in trace monoids ⋮ Distance desert automata and the star height problem ⋮ A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata ⋮ A note on the commutative closure of star-free languages ⋮ Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring ⋮ The star problem and the finite power property in trace monoids: Reductions beyond C4

This page was built for publication: New results on the star problem in trace monoids