A Close Analysis of the Subset Construction
- 29 June 2025
- book chapter
- Published by Springer Nature
- p. 17-33
Abstract
No abstract availableKeywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Theory of átomataTheoretical Computer Science, 2014
- Boolean-width of graphsTheoretical Computer Science, 2011
- Descriptional and computational complexity of finite automata—A surveyInformation and Computation, 2011
- Determination of finite automata accepting subregular languagesTheoretical Computer Science, 2009
- OpenFst: A General and Efficient Weighted Finite-State Transducer Library2007
- Antichains: A New Algorithm for Checking Universality of Finite Automata2006
- Syntactic Semigroups1997
- The parallel complexity of finite-state automata problemsInformation and Computation, 1992
- Efficient representation of perm groupsCombinatorica, 1991
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970