can a DFA have an arrow with empty string as input?
I've seen a picture of an automata represented as a DFA but it has arrows that has nothing on it!
What do these arrows mean in DFA? I mean are they different from epsilon (ε) , because we do not have ε in DFA ! what are they doing ?
And sorry if my question is a bit weird.
Solution
The implied alphabet is {0,1}. So for states with two transitions out, only one needs to be marked, as is the case. If that one is marked "0", the other one is implicitly a 1. If that one is marked "1", the other one is implicitly a 0. For states with one transitions out, that transition represents (1,0).
- Regular Expression for Binary Numbers Divisible by 3
- Steps to draw a DFA (or NFA) from a simple statement?
- 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?
- 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?