Equivalence of regular expressions over a partially commutative alphabet

DOI10.1007/S10559-009-9115-3zbMath1187.68302OpenAlexW1969834155MaRDI QIDQ1040402

A. S. Shoukourian

Publication date: 24 November 2009

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-009-9115-3

zbMATH Keywords

equivalenceautomatonregular expressionpartially commutative alphabet

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• The equivalence problem of multidimensional multitape automata
• Reducibility of program-scheme functional equivalence on a nondegenerate basis of rank unity to the equivalence of automata with multidimensional tapes

This page was built for publication: Equivalence of regular expressions over a partially commutative alphabet