Automata and Computability

Prove that, if A is a regular language, a family of family programs B1, B2, ... exists wherein each Bn accepts exactly the strings in A of length n and is bounded in size by a constant times n.

See attached file for full problem description.

© SolutionLibrary Inc. 9836dcf9d7