On a Maximal NFA Without Mergible States

DOI10.1007/11753728_22zbMath1185.68388OpenAlexW1501317939MaRDI QIDQ3434695

Oleksiy Kurganskyy, Igor Potapov, Igor S.Grunsky

Publication date: 2 May 2007

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11753728_22

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Polynomial inference of universal automata from membership and equivalence queries

This page was built for publication: On a Maximal NFA Without Mergible States