<commit_before># transaction-machine-finite-state-machine
Full Fledge Transaction Management System. Anyone can use the code who wants a system which includes transactions. Will work as a base code template or can be extended to implement full-fledge transaction management system.


Following is the base template and example of a Transaction Management System.
System is implemented using FINITE STATE MACHINE MODEL.
Anyone wants to implement any other transaction management system like paypal, billdesk can use this. Just state needs to get changed,
and after each state any one can process the stuff like DB management. 

TO-DO: This system is in baby phase, unit test-cases need to write. Also has to make it thread safe also.

=====================================Example Transaction System================================

Implement a program that permits definition, creation and execution of finite state machine. 

A state machine definition has the following
•	Finite set of states
•	One or more initial states
•	One or more terminal states
•	One or more events
•	State transitions for events (explained in detail below)


Here is an example of a cash counting state machine. The machine will allow a purchase if and only the user deposits 4 rupees.Note that the lines starting with “//” are comments for your understanding


//states
0S<commit_msg>Description : Updating the README.md file<commit_after># transaction-machine-finite-state-machine
Full Fledge Transaction Management System. Anyone can use the code who wants a system which includes transactions. Will work as a base code template or can be extended to implement full-fledge transaction management system.


Following is the base template and example of a Transaction Management System.
System is implemented using FINITE STATE MACHINE MODEL.
Anyone wants to implement any other transaction management system like paypal, billdesk can use this. Just state needs to get changed,
and after each state any one can process the stuff like DB management. 

TO-DO: This system is in baby phase, unit test-cases need to write. Also has to make it thread safe also.

=======Example Transaction System==============

Implement a program that permits definition, creation and execution of finite state machine. 

A state machine definition has the following
•	Finite set of states
•	One or more initial states
•	One or more terminal states
•	One or more events
•	State transitions for events (explained in detail below)


Here is an example of a cash counting state machine. The machine will allow a purchase if and only the user deposits 4 rupees.Note that the lines starting with “//” are comments for your understanding


//states
0S
{'fraction_non_alphanumeric': 0.06439674315321983, 'fraction_numerical': 0.0014803849000740192, 'mean_word_length': 4.666666666666667, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '3644406', 'n_tokens_mistral': 624, 'n_tokens_neox': 594, 'n_words': 403}