BibTeX record conf/dcfs/EomHK13

download as .bib file

@inproceedings{DBLP:conf/dcfs/EomHK13,
  author       = {Hae{-}Sung Eom and
                  Yo{-}Sub Han and
                  Sang{-}Ki Ko},
  editor       = {Helmut J{\"{u}}rgensen and
                  Rog{\'{e}}rio Reis},
  title        = {State Complexity of Subtree-Free Regular Tree Languages},
  booktitle    = {Descriptional Complexity of Formal Systems - 15th International Workshop,
                  {DCFS} 2013, London, ON, Canada, July 22-25, 2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8031},
  pages        = {66--77},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-39310-5\_8},
  doi          = {10.1007/978-3-642-39310-5\_8},
  timestamp    = {Thu, 23 Jun 2022 19:58:18 +0200},
  biburl       = {https://dblp.org/rec/conf/dcfs/EomHK13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.