Paper • The following article is Open access

The language of left brackets as a morphism of a maximum prefix code

, and

Published under licence by IOP Publishing Ltd
, , Citation B F Melnikov et al 2020 IOP Conf. Ser.: Mater. Sci. Eng. 862 052043 DOI 10.1088/1757-899X/862/5/052043

Download Article PDF

Article metrics

30 Total downloads

Share this article

Author e-mails

bf-melnikov@yandex.ru

Author affiliations

1 Shenzhen MSU – BIT University, 1 International University Park Road, Dayun New Town, Longgang District, Shenzhen, Guangdong Province, 518172, China

2 Northern Arctic Federal University named after M.V. Lomonosov, 17 Northern Dvina, Arkhangelsk, 163001, Russia

3 Vietnam National University, Ho Chi Minh city University of Technology, District 10, Ho Chi Minh city, Vietnam

Buy this article in print

Journal RSS
Sign up for new issue notifications
1757-899X/862/5/052043

Abstract

We investigate the solvability of the equivalence problem in various subclasses of the class of context-free languages. Another fundamental problem necessary for the material in this paper is also the special binary relation for a set of finite languages. Combining these two topics, we obtain in this paper the necessary and sufficient conditions for the equality of two bracketed languages for the prefix-and-suffix case.

Export citation and abstract BibTeX RIS

Previous article in issue
Next article in issue

Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.

Please wait… references are loading.
10.1088/1757-899X/862/5/052043