Decision problems for semi-Thue systems with a few rules
Open Access
- 31 January 2005
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 330 (1) , 145-169
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Undecidable Problems for Probabilistic Automata of Fixed DimensionTheory of Computing Systems, 2003
- Relative Undecidability in Term RewritingInformation and Computation, 2002
- Decidability of Termination of Grid String Rewriting RulesSIAM Journal on Computing, 2002
- GENERALIZED POST CORRESPONDENCE PROBLEM FOR MARKED MORPHISMSInternational Journal of Algebra and Computation, 2000
- ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPSInternational Journal of Algebra and Computation, 1999
- Non-Looping String RewritingRAIRO - Theoretical Informatics and Applications, 1999
- Examples of undecidable problems for 2-generator matrix semigroupsTheoretical Computer Science, 1998
- Termination of rewritingJournal of Symbolic Computation, 1987
- The (generalized) post correspondence problem with lists consisting of two words is decidableTheoretical Computer Science, 1982
- Word and conjugacy problems in groups with only a few defining relationsMathematical Logic Quarterly, 1969