More on the Descriptional Complexity of Products of Finite Automata

Markus Holzer 0001, Christian Rauch. More on the Descriptional Complexity of Products of Finite Automata. In Yo-Sub Han, Sang-Ki Ko, editors, Descriptional Complexity of Formal Systems - 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings. Volume 13037 of Lecture Notes in Computer Science, pages 76-87, Springer, 2021. [doi]

@inproceedings{HolzerR21-0,
  title = {More on the Descriptional Complexity of Products of Finite Automata},
  author = {Markus Holzer 0001 and Christian Rauch},
  year = {2021},
  doi = {10.1007/978-3-030-93489-7_7},
  url = {https://doi.org/10.1007/978-3-030-93489-7_7},
  researchr = {https://researchr.org/publication/HolzerR21-0},
  cites = {0},
  citedby = {0},
  pages = {76-87},
  booktitle = {Descriptional Complexity of Formal Systems - 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings},
  editor = {Yo-Sub Han and Sang-Ki Ko},
  volume = {13037},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-93489-7},
}