Transition Function Complexity of Finite Automata

Maris Valdats. Transition Function Complexity of Finite Automata. In Markus Holzer, Martin Kutrib, Giovanni Pighizzini, editors, Descriptional Complexity of Formal Systems - 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings. Volume 6808 of Lecture Notes in Computer Science, pages 301-313, Springer, 2011. [doi]

@inproceedings{Valdats11,
  title = {Transition Function Complexity of Finite Automata},
  author = {Maris Valdats},
  year = {2011},
  doi = {10.1007/978-3-642-22600-7_24},
  url = {http://dx.doi.org/10.1007/978-3-642-22600-7_24},
  researchr = {https://researchr.org/publication/Valdats11},
  cites = {0},
  citedby = {0},
  pages = {301-313},
  booktitle = {Descriptional Complexity of Formal Systems - 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings},
  editor = {Markus Holzer and Martin Kutrib and Giovanni Pighizzini},
  volume = {6808},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-22599-4},
}