Infinite string rewrite systems and complexity

DOI10.1006/JSCO.1997.0198zbMath0983.68089OpenAlexW1964534500MaRDI QIDQ1264463

Jean-Camille Birget

Publication date: 29 April 2002

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1997.0198

zbMATH Keywords

time complexitydecidable word problem

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (5)

Algorithmically complex residually finite groups ⋮ McNaughton families of languages. ⋮ The derivational complexity of string rewriting systems ⋮ Turing machines and bimachines ⋮ Reductions and functors from problems to word problems

This page was built for publication: Infinite string rewrite systems and complexity