This article introduces a new method for simulating Finite State Automata andNondeterministic Finite State Automata by employing Generalized Nets.

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
https://www.riss.kr/link?id=A110141434
Angel Dimitriev (Sofia University)
2026
English
KCI등재,SCOPUS
학술저널
156-167(12쪽)
0
상세조회0
다운로드다국어 초록 (Multilingual Abstract)
This article introduces a new method for simulating Finite State Automata andNondeterministic Finite State Automata by employing Generalized Nets.
This article introduces a new method for simulating Finite State Automata andNondeterministic Finite State Automata by employing Generalized Nets.
Degree based indices of g-C_3N_5
Spivey-type recurrence relation for fully degenerate Bell polynomials
Topological groups with representations of bounded dimension
On S-weakly 1-absorbing primary ideals and submodules