Theory of computation is always been an issue for the students to understand. This paper present a algorithm which will simplify the method to design Deterministic finite automata that accept strings over input symbol a, b having exactly x number of a & y number of b. Objective of the research is to make the method of teaching learning easier, simpler and understandable for students. In this paper we develop an algorithm to design finite automata that accept strings over input symbol a, b having exactly x number of a & y number of b.

This paper describes a general transformation theory in transforming a sequential C application to Kahn Process Network. It briefly describes in detail the two major transformation steps namely task partitioning and channel generation. We also discuss the previous approaches which automate the transformation from sequential model to parallel model and compare these with our approach.

No abstract

Being a faculty of Theory of computation it had been observed by me that students face difficulty while designing different DFA. It is always being an issue for the students to understand. This paper present an easy way of learning and designing a Deterministic finite automata that accept strings over input symbol {a, b} having atleast x number of a & y number of b. Objective of the research is to make the method of teaching learning easier , simpler and understandable for students. In this paper we develop an algorithm to design finite automata that accepts strings of input {a, b} having atleast x number of a & y number of b .

No abstract