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

2 Answers

1 votes
1 votes
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 votes
0 votes
i mean ,is the string (encoding of fsm) regular??

Related questions

0 votes
0 votes
0 answers
1
Naveen Kumar 3 asked Nov 8, 2018
660 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 cas...
1 votes
1 votes
0 answers
2
ankitgupta.1729 asked Feb 25, 2018
568 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...
1 votes
1 votes
1 answer
3
akankshadewangan24 asked Jun 27, 2017
1,234 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
0 votes
0 votes
0 answers
4
nitish asked May 4, 2017
383 views