COUNTING THE NUMBER OF MINIMAL DFCA OBTAINED BY MERGING STATES
From MaRDI portal
Publication:5696949
DOI10.1142/S0129054103002138zbMath1104.68059MaRDI QIDQ5696949
Publication date: 19 October 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054103002138
deterministic finite automata; minimization; cover language; deterministic cover automata; finite languages
68Q45: Formal languages and automata
Related Items
Cites Work