Given that L is a language accepted by a finite state machine, show that LP and LR are also accepted by some finite state machines, where […]

A language L is a subset of Pascal with the following constructs: (a) Expressions involving the operators ‘+’ and ‘<‘ only (b) Assignment statements (c) ‘while’ […]

Consider the following program fragment in Pascal: Program Main; var X : integer; procedure A: var Y : integer; procedure B: var Z : integer; procedure […]

Following is a state table for some finite state machine. (a) Find the equivalence partition on the states of the machine. (b) Give the state table […]