THE LENGTH OF SUBSET REACHABILITY IN NONDETERMINISTIC AUTOMATA
From MaRDI portal
Publication:3646172
DOI10.1142/S0129054109006942zbMath1186.68264MaRDI QIDQ3646172
Publication date: 19 November 2009
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Related Items (1)
Cites Work
This page was built for publication: THE LENGTH OF SUBSET REACHABILITY IN NONDETERMINISTIC AUTOMATA