Skip to search formSkip to main contentSkip to account menu

Powerset construction

Known as: Power set construction, Determinization of automata, Subset construction 
In the theory of computation and automata theory, the powerset construction or subset construction is a standard method for converting a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
The paper sets forth in detail categorically-algebraic or catalg foundations for the operations of taking the image and preimage… 
2004
2004
This work presents a formal framework for a policy representation model based on finite state transducers (FSTs). The main… 
2003
2003
We investigate the determinization of nondeterministic bottom-up/top-down finite state weighted tree automata over some semiring… 
1998
1998
In large-vocabulary, multi-pass speech recognition systems, it is desirable to generate word lattices incorporating a large… 
Highly Cited
1997
Highly Cited
1997
Granger causality methodology is used to investigate lead-lag relationships between construction activity and aggregate economy… 
Highly Cited
1997
Highly Cited
1997
ABSTRACT Speech recognition requires solving many space and time problems that can have a critical effect on the overall system… 
Highly Cited
1996
Highly Cited
1996
This paper describes the FSA Utilities toolbox: a collection of utilities to manipulate finite-state automata and finite-state… 
1990
1990
The problem of the conceptual unification of the models for concurrent and distributed systems is addressed in terms of…