Kazan (Volga region) Federal University, KFU
KAZAN
FEDERAL UNIVERSITY
 
EFFICIENT ALGORITHMS FOR MEMBERSHIP IN BOOLEAN HIERARCHIES OF REGULAR LANGUAGES
Form of presentationArticles in international journals and collections
Year of publication2016
Языканглийский
  • Selivanov Viktor Lvovich, author
  • Glasser Christian , author
  • Schmitz Heinz , author
  • Bibliographic description in the original language Glasser C. Efficient algorithms for membership in boolean hierarchies of regular languages / C. Glasser, H. Schmitz, V. Selivanov // Theoretical Computer Science. - 2016. - V. 646, Is. C. - P. 86-108. - doi: 10.1016/j.tcs.2016.07.017.
    Annotation Показаны, что уровни нескольких популярных разностных иерархий регулярных языков разрешимы в полиномиальное время
    Keywords Regular language, boolen hierarchy, alternating chain
    The name of the journal Theoretical Computer Science
    Please use this ID to quote from or refer to the card https://repository.kpfu.ru/eng/?p_id=180915&p_lang=2

    Full metadata record