Author:
Melnikov B F,Melnikova A A
Abstract
Abstract
We investigate the solvability of the equivalence problem in the class of bracketed languages and its use in automation systems for building compilers. We obtain the necessary and sufficient conditions for the equality of two simple bracketed languages for the prefix-and-suffix case and some sufficient conditions for two bracketed languages.
Reference11 articles.
1. The equality condition for infinite catenations of two sets of finite words;Melnikov;International Journal of Foundation of Computer Sciences,1993
2. Some grammatical structures of programming languages as simple bracketed languages;Melnikov;Informatica (Lithuanian Acad. of Sciences),2000
3. The language of left brackets as a morphism of a maximum prefix code;Melnikov;IOP Conference Series: Materials Science and Engineering,2020
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献