finite-automatastate-machine
Can {a,b,c}*a^n{a,b,c}*b^n{a,b,c}*c^n{a,b,c} be accepted by an FSA?
I'm looking at some exercices that reguards FSAs and my teacher is giving and odd solution for the language
I would have solved that language with a Not-Deterministic TM cause you have to remember n for a, b and c.
This is the given solution
Is this solution incorrect?
Solution
The example above does work and therefore is correct.
It is clear that for n = 1 the FSA posted above does work.
Now let's condiser the case n > 1, we have to have the same amount of a, b and c between every possible string composed of {a,b,c}. This string can be seen as the same string with n = 1 and the other n - 1 repetitions can be put in the {a,b,c}* group of strings, hence this FSA can accept that language correctly.
- Turing Machine for {XF*X|F)*
- Does C# include finite state machines?
- Create a DFA that contains "11" or ends with "10"
- Regular expression for L = {w|w doesn't contain the substring 110} over the alphabet Σ = {0,1}
- Find a finite automata that for the language L={0,1,2} | needs to include 1002 1,2 are odd and 0 is even
- a challenging finite automata - what is the language?
- Am I correct? (Finite Automata)
- Automaton that recognizes a language without 3 consecutive zeros
- Conversion of NFA having a missing transition for any input character on initial state to DFA
- Finite Automata string not ending with ba
- How do I make a string validator for Deterministic Finite Automata?
- Automata theory: Formal definition of indistinguishable & distinguishable strings and example confusion
- How useful is Turing completeness? are neural nets turing complete?
- NFA or DFA accepting # of positions of 4k between 0's
- How should one proceed to prove (or find) if two regular expressions are same or equivalent?
- Minimum number of states in a DFA having '1' as the 5th symbol from right
- Writing the production rules of this finite state machine
- what is the meaning of {} in the regular expressions {a + ab}*
- What is a finite state transducer?
- Design DFA accepting decimal strings divisible by 7
- How to draw the FA or NFA of b*(ab)*a*
- Difference between transition diagram and finite automata
- What is the application of automata?
- How can I construct finite automata
- Why is {a^nb^n | n <= 10} regular?
- What is the benefit of minimizing a finite automata?
- Complement of non-deterministic context-free language
- Creating a deterministic finite automata
- Can I use stack in Turing Machine?
- Definition of the "DFA for a language"