Transition Complexity of Incomplete DFAs
From MaRDI portal
Publication:3100931
DOI10.3233/FI-2011-533zbMath1230.68130MaRDI QIDQ3100931
Kai Salomaa, Yuan Gao, Sheng Yu
Publication date: 22 November 2011
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Boolean operations; regular languages; deterministic finite automaton; transition complexity; incomplete automaton
68Q45: Formal languages and automata