VOLUME 7 2002 NUMBER 4
On the Complexity of a Problem on Monadic String Rewriting Systems
Ferucio Laurenţiu Ţiplea, Erkki Mäkinen
Pages 599–609



Download Abstract
 Fulltext is accessible with your personal account
 ShowHide BibTeX
BibTeX: 
@article{JALC-2002-599,
  author  = {Ferucio Lauren{\s{t}}iu {\s{T}}iplea and Erkki M{\"{a}}kinen},
  title   = {On the Complexity of a Problem on Monadic String Rewriting Systems},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {7},
  number  = {4},
  pages   = {599--609},
  year    = {2002},
  url     = {https://doi.org/10.25596/jalc-2002-599},
  doi     = {10.25596/jalc-2002-599}
}
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: formal languages, decision problems, monadic string rewriting systems, synchronized extension systems, computational complexity
DOI: 10.25596/jalc-2002-599