Minimal partial languages and automata
From MaRDI portal
Publication:4602380
DOI10.1051/ita/2017011zbMath1382.68185MaRDI QIDQ4602380
Kira Goldner, Aidan Shackleton, Francine Blanchet-Sadri
Publication date: 10 January 2018
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/b13c69f1801e3d65f3bd88232f11c429fc767c9f
automata; deterministic finite automata; formal languages; regular languages; partial words; nondeterministic finite automata; partial languages
Related Items
State complexity of finite partial languages, Lyndon partial words and arrays with applications, State complexity of partial word finite automata, State complexity of finite partial languages