VOLUME 5 2000 NUMBER 4
On Dehn Functions of Finitely Presented Bi-Automatic Monoids
Friedrich Otto
Pages 405–419



Download Abstract
 Fulltext is accessible with your personal account
 ShowHide BibTeX
BibTeX: 
@article{JALC-2000-405,
  author  = {Friedrich Otto},
  title   = {On Dehn Functions of Finitely Presented Bi-Automatic Monoids},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {5},
  number  = {4},
  pages   = {405--419},
  year    = {2000},
  url     = {https://doi.org/10.25596/jalc-2000-405},
  doi     = {10.25596/jalc-2000-405}
}
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: automatic monoid, string-rewriting system, derivation, Dehn function, recursive function, sufficiently rich complexity class
DOI: 10.25596/jalc-2000-405