VOLUME 23 2018 NUMBERS 1–3
What is a Complex Regular Language?
Cezar Câmpeanu
Pages 111–126



Download Abstract
 Fulltext is accessible with your personal account
 ShowHide BibTeX
BibTeX: 
@article{JALC-2018-111,
  author  = {Cezar C{\^a}mpeanu},
  title   = {What is a Complex Regular Language?},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {23},
  number  = {1--3},
  pages   = {111--126},
  year    = {2018},
  url     = {https://doi.org/10.25596/jalc-2018-111},
  doi     = {10.25596/jalc-2018-111}
}
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: regular languages, state complexity, Kolmogorov complexity, Blum static complexity spaces, encoded spaces, randomness, distinguishability
DOI: 10.25596/jalc-2018-111