Open AccessThe language of left brackets as a morphism of a maximum prefix code
Author(s) -
Boris Melnikov,
Svetlana Korabelshchikova,
V. V. Dang
Publication year - 2020
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/862/5/052043
Subject(s) - prefix , morphism , suffix , mathematics , equivalence (formal languages) , regular language , context free language , context (archaeology) , abstract family of languages , equivalence relation , computer science , discrete mathematics , programming language , second generation programming language , linguistics , theoretical computer science , automaton , natural language processing , paleontology , inductive programming , philosophy , programming paradigm , biology , rule based machine translation
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.