From finite automata to regular expressions and back—a summary on descriptional complexity

Record

Authors
Gruber, H.; Holzer, M.
Year
2014
Title
From finite automata to regular expressions and back—a summary on descriptional complexity
Published in
Automata and Formal Languages 2014 (AFL 2014)
Pages
25–48
Type
Conference paper
DOI
10.4204/eptcs.151.2
arXiv
arXiv:1405.5594
Our note
none yet
Verification
unverified: not yet checked against the source
Id
gruber-2014-from-finite-automata-regular-expressions-back

Cited on

As cited

The pages cite this work in one form.

  • Gruber, H., and Holzer, M. (2014). From finite automata to regular expressions and back—a summary on descriptional complexity. In Automata and Formal Languages 2014 (AFL 2014), Electronic Proceedings in Theoretical Computer Science 151, 25–48. doi:10.4204/EPTCS.151.2. arXiv:1405.5594.

BibLaTeX

@inproceedings{gruber-2014-from-finite-automata-regular-expressions-back,
  author = {Gruber, H. and Holzer, M.},
  title = {{From finite automata to regular expressions and back—a summary on descriptional complexity}},
  booktitle = {Automata and Formal Languages 2014 (AFL 2014)},
  date = {2014},
  pages = {25--48},
  doi = {10.4204/eptcs.151.2},
  eprint = {1405.5594},
  eprinttype = {arxiv}
}

Download · JSON with CSL-JSON · the whole bibliography