On the decidability of the equivalence problem for partially commutative rational power series

DOI10.1016/0304-3975(92)90354-IzbMath0779.20038MaRDI QIDQ1193904

Stefano Varricchio

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

equivalence problemrational power seriesfree partially commutative monoidequality theorem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (2)

The lower central series of the free partially commutative group ⋮ Stefano Varricchio (1960-2008)

Cites Work

• The equivalence problem of multitape finite automata
• On regular trace languages
• The lower central series of the free partially commutative group
• Multitape one-way nonwriting automata
• Trace languages defined by regular string languages
• Observations on group rings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the decidability of the equivalence problem for partially commutative rational power series