The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
- 1 November 1978
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 7 (4) , 524-532
- https://doi.org/10.1137/0207042
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Reversal-Bounded Multicounter Machines and Their Decision ProblemsJournal of the ACM, 1978
- The unsolvability of the equality problem for sentential forms of context-free grammarsJournal of Computer and System Sciences, 1973
- The equivalence problem for deterministic two-tape automataJournal of Computer and System Sciences, 1973
- The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machinesJournal of the ACM, 1968
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959