Some programming problems do not require the full power of a Turing machine. They can be solved with much less power. I am looking for a programming language with less power.
Is there a high-level programming language that is limited to supporting only these features:
Stack with operations for entering values onto the stack and pop values from the stack.
Finite state machine (FSM) for entering values, switching from state to state, interacting with glass and displaying results.
I understand that I could use Java or C or Python (etc.) and restrict the language by writing a program that just uses the stack and FSM. Nevertheless, I am looking for a programming language that has only these features and nothing more.
In other words, I don’t want to use the full Turing programming language to solve problems that require only the power of deterministic unlocked machines. I want to use a programming language that has only the ability of deterministic automata with unlocking.
source
share