4 ms·
Design a DFA
Design a DFA that accepts the language L= { x ∈ {0,1}* : the third bit from the left is 1 in x}
I have a solution but I am unablel to work this out. Please guide me.
- sargstuff 5y agobit long winded, in order to lead to answer without providing answer. issue: trying to cover all bases when matching up theory (generalization/abstraction) and reality (specification/implimentation) always depends on the terminal conditions/assumptions. aka where/how/what the end/stop point(s) are. objective: provide a working example of dfa. reality assumptions: what are the relevant programming language/operating system abstractions/assumptions that hide details that theory/algorithms can dodge/ignore, and/or allow programmer to not be concerned with. actual working program realities: what programming language constraints/assumptions were made/used to define/constrain x (terminal case/cases) in order to use the programming language to find the 'bit' in question? aka what is the bit part of, which then dictates how to use the program language to find the answer. how many different constraints/ways does a programming language rovide/allow to accomplish/impliment the same dfa! (standard & wierd ways of using program language) gotchas: is the terminal case(s) the base/end case & not an abstraction/symbol needing to be further broken down/defined (the monad)