search
Log In
1 vote
313 views
Suppose we have an encoding of a fsm ... 1.is it regular? 2.does the fsm accepts its own encoding ?
in Theory of Computation 313 views
0

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

2 Answers

1 vote
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.
0
Yes sir you got the question correctly plz explain this line "That depends on the encoding you choose"
0 votes
i mean ,is the string (encoding of fsm) regular??
0
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.

Related questions

0 votes
0 answers
1
211 views
Answer the following:- 1. Worst case time complexity to minimize DFA? 2. Best case time complexity to minimize DFA? 3. Worst case time complexity to minimize NFA? 4. Best case time complexity to minimize NFA?
asked Nov 8, 2018 in Theory of Computation Naveen Kumar 3 211 views
0 votes
0 answers
2
240 views
Is minimization of Finite State Machine(FSM) based on Dynamic Programming(DP) paradigm ? If yes , then what should be the optimal substructure and overlapping subproblems ?
asked Feb 25, 2018 in Theory of Computation ankitgupta.1729 240 views
1 vote
1 answer
3
447 views
DFSM with 1 stack has same power as NDFSM with 1 stack is False .Why? DFSM with 2 stack has same power as NDFSM with 2 stack is TRUE .Why? these confusing. help me
asked Jun 27, 2017 in Theory of Computation akankshadewangan24 447 views
0 votes
0 answers
4
141 views asked May 4, 2017 in Theory of Computation nitish 141 views
...