has been cited by the following article(s):
[1]
|
Simple algorithm to construct deterministic finite automata from non-deterministic finite automata using initial state transitions successor
|
|
AIP Conference Proceedings,
2022 |
|
|
[2]
|
Turing Machine Engenders the Grammar for Formal Languages and Machine Design
|
|
2021 |
|
|
[3]
|
Simplified Deterministic Finite Automata Construction Algorithm from Language Specification
|
|
2018 |
|
|
[4]
|
An Effect of Particle Swarm Optimization on SDLC
|
|
2016 |
|
|
[5]
|
An UML+ Z Framework For Validating And Verifying the Static Aspect of Safety Critical System
|
|
Procedia Computer Science,
2016 |
|
|
[6]
|
Comparative Study and Performance Evaluation of Formal Specification Language based on Z, B and VDM Tools
|
|
International Journal of Scientific & Engineering Research,
2015 |
|
|
[7]
|
Comparative study and performance evalua-tion of formal specification language based on Z, B and VDM tools
|
|
International Journal of Scientific & Engineering …,
2015 |
|
|
[8]
|
Possible Improvements in UML Behavior Diagrams
|
|
Computational Science and Computational Intelligence (CSCI), 2014 International Conference on. Vol. 2. IEEE,
2014 |
|
|
[9]
|
Model Analysis of Equivalence Classes in UML Events Relations
|
|
Journal of Software Engineering and Applications,
2013 |
|
|
[10]
|
The Equivalent Conversion between Regular Grammar and Finite Automata
|
|
Journal of Software Engineering and Applications,
2013 |
|
|
[1]
|
Simple algorithm to construct deterministic finite automata from non-deterministic finite automata using initial state transitions successor
THE 2ND UNIVERSITAS LAMPUNG INTERNATIONAL CONFERENCE ON SCIENCE, TECHNOLOGY, AND ENVIRONMENT (ULICoSTE) 2021,
2022
DOI:10.1063/5.0106219
|
|
|
[2]
|
An UML+Z Framework For Validating And Verifying the Static Aspect of Safety Critical System
Procedia Computer Science,
2016
DOI:10.1016/j.procs.2016.05.243
|
|
|
[3]
|
Possible Improvements in UML Behavior Diagrams
2014 International Conference on Computational Science and Computational Intelligence,
2014
DOI:10.1109/CSCI.2014.113
|
|
|
[4]
|
The Equivalent Conversion between Regular Grammar and Finite Automata
Journal of Software Engineering and Applications,
2013
DOI:10.4236/jsea.2013.61005
|
|
|