Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
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
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.