Showing posts with label design NFA. Show all posts
Showing posts with label design NFA. Show all posts
Thursday, 16 May 2019
Design Non-Deterministic Finite Automata 2
The next...
We can also make a design NFAs with 2 states and the rules are: strings that can be received must start with '0'.
Examples of acceptable strings:
We can also make a design NFAs with 2 states and the rules are: strings that can be received must start with '0'.
Examples of acceptable strings:
- '0',
- '00',
- '01',
- '0 *',
- '01 * ',
- '01 * 0 *',
- '0 * 1 *', ...
Design the NFA
Transition Table
Design Non-Deterministic Finite Automata 1
We can design the NFA with 3 states and the rule is: the string that can be received must end in 'ab'.
Examples of strings that can be accepted:
Examples of strings that can be accepted:
- 'ab',
- 'aab',
- 'a * ab',
- 'bab',
- 'b * ab',
- 'abab',
- 'a * b * ab',
- 'b * a * ab '
Design the NFA
Subscribe to:
Posts (Atom)
-
Buatlah DFA yang ekuivalen dengan NFA berikut : Q = { p, q, r, s } ∑ = { 0, 1 } S = p F = { q, s } Fungsi Transisi ...
-
Neural networks are a class of machine learning models inspired by the structure and function of the human brain. They are a fundamental com...
-
Cara Memunculkan Tab Developer Excel di Macbook atau iOS hampir sama di Windows, simak video berikut ini:
