VOLUME 12 2007 NUMBER 3

An Examination of Ohlebusch and Ukkonen's Conjecture on the Equivalence Problem for E-Pattern Languages
Daniel Reidenbach
Pages 407–426





Download Abstract
Fulltext is accessible with your personal account
ShowHide BibTeX
BibTeX:
@article{JALC-2007-407,
  author  = {Daniel Reidenbach},
  title   = {An Examination of {O}hlebusch and {U}kkonen's Conjecture on the Equivalence Problem for {E}-Pattern Languages},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {12},
  number  = {3},
  pages   = {407--426},
  year    = {2007},
  url     = {https://doi.org/10.25596/jalc-2007-407},
  doi     = {10.25596/jalc-2007-407}
}
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: pattern languages, decision problems, combinatorics on words, terminalpreserving morphisms, ambiguity
DOI: 10.25596/jalc-2007-407