The local catenativity of DOL-sequences in free commutative monoids is decidable in the binary case

DOI10.1051/ita/1992260504251zbMath0768.68078OpenAlexW320638168MaRDI QIDQ4020511

J. L. Lambert

Publication date: 17 January 1993

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92426

zbMATH Keywords

decidabilityfree monoid

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Matrices of integers (15B36)

Cites Work

• Unnamed Item
• Unnamed Item
• Development systems with locally catenative formulas
• On finitely generated monoids of matrices with entries in $\mathbb {N}$

This page was built for publication: The local catenativity of DOL-sequences in free commutative monoids is decidable in the binary case