About the descriptive power of certain classes of finite string-rewriting systems
- 1 October 1989
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 67 (2-3) , 143-172
- https://doi.org/10.1016/0304-3975(89)90002-9
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- Groups presented by finite two-monadic Church-Rosser Thue systemsTransactions of the American Mathematical Society, 1986
- Pseudo-natural algorithms for the word problem for finitely presented monoids and groupsJournal of Symbolic Computation, 1985
- NTS languages are deterministic and congruentialJournal of Computer and System Sciences, 1985
- The accessibility of finitely presented groupsInventiones Mathematicae, 1985
- Decidable sentences of Church-Rosser congruencesTheoretical Computer Science, 1983
- Groups, the Theory of ends, and context-free languagesJournal of Computer and System Sciences, 1983
- Confluent and Other Types of Thue SystemsJournal of the ACM, 1982
- A connection between the integral homology and the centre of a rational linear groupMathematische Zeitschrift, 1980
- Presentations of groups and monoidsJournal of Algebra, 1979
- Group languagesCybernetics and Systems Analysis, 1974