Let L be a language whose FA consist of 5 acceptance states and 11 non final states. It further consists of a dumping state. Predict the number of acceptance states in Lc.
Let L be a language whose FA consist of 5 acceptance states and 11 non final states. It further consists of a dumping state. Predict the number of acceptance states in Lc. Correct Answer 16
If L leads to FA1, then for Lc, the FA can be obtained by exchanging the final and non-final states.
মোঃ আরিফুল ইসলাম
Feb 20, 2025