stack - Is there a programming language that only has the power of a deterministic push-down automata, and no more? -
some programming problems don't require full power of turing machine solve. can solved less power. seeking programming language lesser power.
does there exist high-level programming language constrained support these capabilities:
a stack operations push values onto stack , pop values off stack.
a finite state machine (fsm) input values, move state state, interact stack, , output results.
i realize use java or c or python (etc.) , constrain language writing program uses stack , fsm. however, seeking programming language has these capabilities , no more.
in other words, don't want use turing-complete programming language solve problems requires power of deterministic push-down automata. want use programming language has power of deterministic push-down automata.
in short, you're not going find high level language little power. isn't strictly definition, high level implies amount of abstraction corresponds complexity.
however, isn't issue: don't need worried using power. machine language, canonically efficient language (minimal overhead!) turing complete, indicating efficiency not tightly bound theoretical power.
Comments
Post a Comment