On the decidability of some problems about rational subsets of free partially commutative monoids
Authors:
- Alan GibbonsAGAlan Gibbons
- Wojciech RytterWRWojciech Rytter
- 31 December 1986
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 48, 329-337
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and ApplicationsSIAM Journal on Computing, 1978
- Reversal-Bounded Multicounter Machines and Their Decision ProblemsJournal of the ACM, 1978
- Concurrent Program Schemes and their InterpretationsDAIMI Report Series, 1977