VOLUME 1 1996 NUMBER 1
On the Modularity of Decidability of Completeness and Termination
Kai Salomaa
Pages 37–53



Download Abstract
 Fulltext is accessible with your personal account
 ShowHide BibTeX
BibTeX: 
@article{JALC-1996-037,
  author  = {Kai Salomaa},
  title   = {On the Modularity of Decidability of Completeness and Termination},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {1},
  number  = {1},
  pages   = {37--53},
  year    = {1996},
  url     = {https://doi.org/10.25596/jalc-1996-037},
  doi     = {10.25596/jalc-1996-037}
}
If you would like to see an embedded preview, try to select preview as the action for Portable Document Format (PDF) in your brower settings.
Keywords: term rewriting systems, modularity, decidability, Post Correspondence Problem
DOI: 10.25596/jalc-1996-037