Skip Navigation

The Computer Journal 1973 16(4):351-356; doi:10.1093/comjnl/16.4.351
© 1973 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bordier, J.
Right arrow Articles by Saya, H.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A necessary and sufficient condition for a power language to be LL(k)*

J. Bordier1 § and H. Saya2 ¶

1 Departement de Mathematiques, Universite de Sherbrook, Quebec, Canada,, 2 Institut de Mathematiques Appliquees, B.P. 53 Centre de Tri/38041, Grenoble, France

We define two families of languages P and P1 and give criteria about the form of the words of these languages used to determine whether they belong to the family of LL(K) languages. Some related results are demonstrated.

Received September 1971.

* Results mainly obtained at the Université de Grenoble, under the Centre National de la Recherche Scientifique and IBM France, additional work carried out at the Université de Sherbrooke with the Conseil National de Recherches du Canada, Octroi No. 4337.

§ Départment de Mathématiques, Université de Sherbrook, Québec, Canada

Institut de Mathématiques, Appliquées, B. P. 53 Centre de Tri/38401 Grenoble Cedex, France


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.