@INPROCEEDINGS{Pru14dcfs,
  author = {Průša, Daniel},
  title = {Non-recursive Trade-offs between Two-Dimensional Automata and Grammars},
  booktitle = {DCFS 2014: Proceedings of the 16th International Workshop on Descriptional
    Complexity of Formal Systems},
  year = {2014},
  editor = {Jürgensen, Helmut and Karhumäki, Juhani and Okhotin, Alexander},
  volume = {8614},
  series = {Lecture Notes in Computer Science},
  pages = {352--363},
  address = {Berlin, Germany},
  month = {August},
  publisher = {Springer},
  affiliation = {13133},
  annote = {We study succinctness of descriptional systems for picture languages.
    Basic models of two-dimensional finite automata and generalizations
    of context-free grammars are considered. It is shown t hat non-recursive
    trade-offs between the systems are very common. The results are based
    on the ability of th e systems to simulate Turing machines.},
  book_pages = {363},
  day = {5--8},
  doi = {10.1007/978-3-319-09704-6_31},
  isbn = {978-3-319-09703-9},
  keywords = {picture languages, four-way automata, two-dimensional context-free
    grammars, des criptional complexity},
  project = {GACR P103/10/0783},
  update = { 2014-12-16 },
  url = {http://dx.doi.org/10.1007/978-3-319-09704-6_31},
  venue = {Turku, Finland}
}