A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Generating Functional Implementations of Finite State Automata in C# 3.0
2009
Electronical Notes in Theoretical Computer Science
Finite state automata (FSA) implementations are widely used in IT due to their rich application possibilities, flexibility, and their direct relationship with common goals set by regular business applications. Workflowbased programming has opened up a new exciting application area: workflows governed by FSA. The field is gaining more and more attention, the .NET 3.0 platform contains an engine called Workflow Foundation dedicated to managing workflows. However, due to the advantageous
doi:10.1016/j.entcs.2009.05.002
fatcat:rfv5wrmaizedplslwlbqice4uy