FSM

Question

Suppose we have an encoding of a fsm ... 1.is it regular? 2.does the fsm accepts its own encoding ?

Comments

Suppose we have an encoding of a fsm ... 1.is it regular? 
What is "IT" ?

Answer 1

I guess what you mean is weather the set of encodings of all fsms is regular.

That depends on the encoding you choose, and yes we can create an ecoding such the the set of all encodings is regular.

A fsm which accepts the set of all encodings will then accept its own encoding.

Comments

Yes sir you got the question correctly plz explain this line "That depends on the encoding you choose"

---

refer to http://cs.stackexchange.com/questions/2682/is-the-set-of-codes-of-deterministic-finite-state-automata-a-regular-language

Answer 2

i mean ,is the string (encoding of fsm) regular??

Comments

A language is a set of strings. Regularity property is for such sets. We cannot apply it to a single string. If you put that string in a set, it becomes a singleton set- which is finite and hence regular also.