VOLUME 22 2017 NUMBERS 1–3
Unrestricted State Complexity of Binary Operations on Regular and Ideal Languages
Janusz A. Brzozowski, Corwin Sinnamon
Pages 29–59



Download Abstract
 Fulltext is accessible with your personal account
 ShowHide BibTeX
BibTeX: 
@article{JALC-2017-029,
  author  = {Janusz A. Brzozowski and Corwin Sinnamon},
  title   = {Unrestricted State Complexity of Binary Operations on  Regular and Ideal Languages},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {22},
  number  = {1--3},
  pages   = {29--59},
  year    = {2017},
  url     = {https://doi.org/10.25596/jalc-2017-029},
  doi     = {10.25596/jalc-2017-029}
}
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: boolean operation, concatenation, different alphabets, left ideal, most complex language, product, quotient complexity, regular language, right ideal, state complexity, stream, two-sided ideal, unrestricted complexity
DOI: 10.25596/jalc-2017-029