An algorithm to decide whether a rational subset of N k is recognizable
- 31 December 1985
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 41, 51-59
- https://doi.org/10.1016/0304-3975(85)90059-3
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Rational sets in commutative monoidsJournal of Algebra, 1969
- Bounded Regular SetsProceedings of the American Mathematical Society, 1966