3

Do you know any programming language that implements abstract machines like Turing machines and Finite State Automatons?

That is, process the following input:

And tell me if the input word was an accepting word.

Thanks,

Adam

Improve this question

2 Answers 2

Reset to default
2

The J programming language provides a finite state machine processor as a primitive symbol of the language. The documentation for that symbol is here.

That said, let me warn that Sequential Machine is not a suitable starting point for the J language. It's an advanced component. Attempting to use it without significant familiarity with J will likely result in much frustration.

An accessible essay that demonstrates the use of J's Sequential Machine is Huffman Coding.

Improve this answer
Sign up to request clarification or add additional context in comments.

Comments

0

I don't know about the Turing machine. I'm sure people have written simulators out there. For the FSAs, you could just use a regular expression. :)

Improve this answer

1 Comment

I'm looking for a broader language that would utilize the tuple notation.

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.