With Turing machines, by imposing certain restrictions on the form of the transition function, one can get a machine that accepts only regular languages. I am wondering what is the counterpart in lambda calculus? In other words, how to restrict lambda calculus so it accepts only regular languages?Related papers would be great, just as an explanation if my question does not make any sense, if that is the case.
Regular languages in lambda calculus
turing machines;lambda calculus;regular language