On the Computational Complexity of Partial Word Automata Problems

DOI10.3233/FI-2016-1435zbMath1380.68226OpenAlexW2563201274MaRDI QIDQ4589235

Markus Holzer, Matthias Wendlandt, Sebastian Jakobi

Publication date: 9 November 2017

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2016-1435

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (3)

State complexity of finite partial languages ⋮ State complexity of partial word finite automata ⋮ State complexity of finite partial languages

This page was built for publication: On the Computational Complexity of Partial Word Automata Problems