Finite State Machine Generation
Finite State Machine Generation is a computational method that systematically constructs finite state machines by defining states, transitions, and input/output behaviors according to specified formal rules or constraints.
68
Publications
2.7K
Citations
152
Authors
78
Institutions
Publications per year
2017–2026
5
Variants
Fsm Generation
Parents
68
1–5 of 68
152
6
h-index
4
h-index
2
h-index
2
h-index
2
h-index
1–5 of 152
78

Brunel University of London
London, United Kingdom
5 h-index
11 publications
221 citations
University of Minnesota System
Minneapolis, United States
4 h-index
5 publications
99 citations

University of Ottawa
Ottawa, Canada
3 h-index
3 publications
376 citations
Microsoft (United States)
Redmond, United States
2 h-index
8 publications
1.1K citations
The University of Texas at Austin
Austin, United States
2 h-index
3 publications
253 citations
Motorola (United States)
Schaumburg, United States
2 h-index
2 publications
132 citations
Texas A&M University
College Station, United States
2 h-index
4 publications
264 citations

Edinburgh Napier University
Edinburgh, United Kingdom
1 h-index
4 publications
236 citations
1–8 of 78
6 publications · 181 citations
6
h-index
4 publications · 77 citations
4
h-index
3 publications · 272 citations
3
h-index
SEN · 2 publications · 198 citations
2
h-index
TOSEM · 2 publications · 33 citations
2
h-index
1–5