Finitely presented expansions of computably enumerable semigroups
- 1 November 2012
- journal article
- Published by Springer Nature in Algebra and Logic
- Vol. 51 (5) , 435-444
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Two notes on subshiftsProceedings of the American Mathematical Society, 2011
- Computable symbolic dynamicsMathematical Logic Quarterly, 2008
- Generic-case complexity, decision problems in group theory, and random walksJournal of Algebra, 2003
- Randomness, computability and algebraic specificationsAnnals of Pure and Applied Logic, 1998
- Algebras with finitely approximable positively representable enrichmentsAlgebra and Logic, 1987
- Algebraic specifications of computable and semicomputable data typesTheoretical Computer Science, 1987
- Recursively Enumerable Sets and Degrees1987
- Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization TheoremsSIAM Journal on Computing, 1983
- Universal Algebra1979