Minimal partial languages and automata

DOI10.1051/ITA/2017011zbMath1382.68185OpenAlexW4246593164MaRDI 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

zbMATH Keywords

automatadeterministic finite automataformal languagesregular languagespartial wordsnondeterministic finite automatapartial languages

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (4)

Lyndon partial words and arrays with applications ⋮ 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: Minimal partial languages and automata