Abstract

We generalize the class of sofic subshifts, which correspond to regular languages, to subshifts accepted by either nondeterministic or deterministic Turing machines in real time. We show that every substitutive system can be accepted by a deterministic Turing machine in real time.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.