Abstract
Pre-NTS languages have been introduced together with NTS languages by Boasson and Senizergues. In this paper we study the pre-NTS grammars. Our main result is that pre-NTS grammars have a decidable equivalence problem.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
