NFA to DFA conversion
When we converting from nfa to dfa there may be result like the image below... My question is, is it necessary to write that from state {4} it's going to Zero state? I mean that without showing the input symbol 1 of {4} is the same with picture below right? or no?
It’s a matter of convention. Personally, I prefer not to clutter my DFA with unnecessary states, especially since DFAs obtained via transformation from NFAs tend to become quite complex anyway, and since it’s deterministic we know that any non-displayed transition must be invalid.
However, I’ve experienced that many people in academia teach / use the other convention, and require all transitions to be explicitly shown. When working as a TA (tutor) I’ve actually had a discussion with a professor about this – he wanted us tutors to deduct points on the final tests for missing transitions in DFAs but I convinced him that deducting points for this was unfair.
- Are my DFA's correct? (arbitrary long sequence of 0's and 1's)
- DFA for all binary strings having even number of 0's or contains exactly two 1's
- Create a DFA that contains "11" or ends with "10"
- Theory of computer science problems
- a challenging finite automata - what is the language?
- State diagram of DFA with 5 states
- Am I correct? (Finite Automata)
- What strings are accepted by the pattern "^[ab]?|c?$"?
- Conversion of NFA having a missing transition for any input character on initial state to DFA
- Automata theory: Formal definition of indistinguishable & distinguishable strings and example confusion
- Regular Expression for Automata for Strings that do not end in 01
- DFA- Set of all strings whose 10th symbol from the right end is 1
- NFA or DFA accepting # of positions of 4k between 0's
- Minimum number of states in a DFA having '1' as the 5th symbol from right
- Why do we use pumping lemma to prove the non-regularity of languages? WHY?
- can a DFA have an arrow with empty string as input?
- Why L={wxw^R| w, x belongs to {a,b}^+ } is a regular language
- Parser vs. lexer and XML
- Can all context free grammars be converted to NFA/DFA?
- Design DFA accepting decimal strings divisible by 7
- Is L = {a^n a^n b^m |m, n ≥ 0} a regular or irregular language?
- Are those two regular languages the same?
- Steps to draw a DFA (or NFA) from a simple statement?
- NFA to DFA conversion = deterministic?
- Regular Expression to DFA
- DFA that will accepts the string having odd number of 1's and odd number of 0's
- How to find longest accepted word by automata?
- How to apply Kleene star on automata?
- When minimizing DFAs through table fill, should a pair of final states transition to a final/undetermined(dead) pair be treated as distinguishible?
- How to find the intersection of two NFA