Abstract
Skewlinear tuple grammars are introduced as generalization of even linear and k -linear context-free grammars. The family of skewlinear tuple languages coincides with the family of languages generated by o -regular expressions. Many questions which are unsolvable for context-free languages and hence for tuple languages are solvable for skewlinear tuple languages. Every skewlinear tuple language can be recognized by a deterministic one-tape Turing machine of time complexity T ( r ) = r 2 and by a deterministic one-tape Turing machine with two-way input tape of tape complexity L ( r ) = log r .
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
