Given a set of strings is there a finite-state automaton


Question: Which of the following problems is a decision problem?

a) What is the smallest prime greater than n?

b) Is a graph G bipartite?

c) Given a set of strings, is there a finite-state automaton that recognizes this set of strings?

d) Given a checkerboard and a particular type of polyomino (see Section 1.8), can this checkerboard be tiled using polyominoes of this type?

Solution Preview :

Prepared by a verified Expert
Theory of Computation: Given a set of strings is there a finite-state automaton
Reference No:- TGS02373379

Now Priced at $10 (50% Discount)

Recommended (97%)

Rated (4.9/5)