Nondeterministic finite automata   

Wael Almattar
 

T h e
M A I N
I D E A

finite state machine is called a deterministic finite automaton (DFA), if:

1. each of its transitions is uniquely determined by its source state and input symbol
2. reading an input symbol is required for each state transition.

Formal NFA

1. each of its transitions is uniquely determined by its source state and input symbol
   
2. reading an input symbol is required for each state transition.

H O W
I T
W O R K S

WORKFLOW

WORKFLOW in practice

Database

Technologies

+

Smart Python multi-Agent Development Environment

• Based on XMPP/Jabber technology
• Writtern in Python
• Still supported
• Will be compatible with C# and Java

NLTK

Natural Language Toolkit

• Build for Python
• Works with human language data
• Well supported

Leading NoSQL Database

• Simple and elegant
• 1st noSQL engine
• 4th most famous database engine
• Well corresponding to the project's needs

W H A T
I N
T H E 
F U T U R E ?

• Working with other webpages
• Expanding program to other languages (C#, Java)
• Getting more information using Natural Language Toolkit

THANK
YOU!