in my practice for a test I came across this question: prove or disprove that those languages are regular:
I succeeded proving that the second language is nonregular with homomorphism but i'm having trouble with the other 2 -
my intuition tellin me that first 1 is Σ∗ but i'm really stuck on how to prove it
(not sure why it writes 2 when i'm writin 3 haha) in this one i'm really stuck - my intuition is tellin me again that it will be finite automaton (automata? sorry if my english is not so good) and therefore regular language but how can I prove it? how can I use the fact that |w| is bounded? - i guess I need to build an automaton , maybe with some "flags" but I suck at it (for now) :[.
does ww^R is regular language when |w| is bounded? I've looked a lot (through google in this site) for an answer for this question but I havent find something - only that this language is not regular when |w| is not bounded.
Can I get some hints on both of those languages please?