On the finite-valuedness problem for sequential machines
- 31 March 1988
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 23 (1), 95-101
- https://doi.org/10.1016/0304-3975(88)90012-6
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A note on finite-valued and finitely ambiguous transducersTheory of Computing Systems, 1983
- On some decision questions concerning pushdown machinesTheoretical Computer Science, 1983
- On the equivalence and containment problems for unambiguous regular expressions, grammars, and automataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- What makes some language theory problems undecidableJournal of Computer and System Sciences, 1970
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970