📘 automata theory

1. **Problem Statement:** We need to model a vending machine as a finite state automaton (FSA) that accepts inputs of money denominations Rp. 5,000, Rp. 10,000, Rp. 20,000, and Rp.

1. **Problem Statement:** Convert the given Non-Deterministic Finite Automata (NFA) into equivalent Deterministic Finite Automata (DFA). 2. **Key Concepts:**

1. **Problem Statement:** Identify the language recognized by the given DFA with states 0 to 7, initial state 0, and terminal states 5, 6, and 7. 2. **Understanding the DFA:** The

1. **Problem Statement:** Determine if the strings "ababbaaa" and "abaa" are accepted or rejected by the given automata A, B, and C. 2. **Understanding the Automata:** Each automat