State Complexity of Partial Word Finite Automata

Martin Kutrib, Matthias Wendlandt. State Complexity of Partial Word 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 113-124, Springer, 2021. [doi]

Abstract

Abstract is missing.