Equality Sets and Complexity Classes
- 1 November 1980
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 9 (4) , 729-743
- https://doi.org/10.1137/0209057
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Multiple equality sets and post machinesJournal of Computer and System Sciences, 1980
- Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable LanguagesJournal of the ACM, 1980
- Polynomial Space and Transitive ClosureSIAM Journal on Computing, 1979
- A Purely Homomorphic Characterization of Recursively Enumerable SetsJournal of the ACM, 1979
- On simple representations of language familiesRAIRO. Informatique théorique, 1979
- On the homomorphic characterizations of families of languagesLecture Notes in Computer Science, 1979
- On the decidability of homomorphism equivalence for languagesJournal of Computer and System Sciences, 1978
- The equation $a^M=b^Nc^P$ in a free group.The Michigan Mathematical Journal, 1962
- Theory of Formal Systems. (AM-47)Published by Walter de Gruyter GmbH ,1961