Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Boris Karlov"'
Autor:
Michael Dekhtyar, Boris Karlov
Publikováno v:
Моделирование и анализ информационных систем, Vol 22, Iss 2, Pp 176-196 (2015)
Push-down automata with independent counters (PDACs) combine the power of PDAs and Petri Nets. They were developed in [21, 15], as a tool of recognition of languages generated by Categorial Dependency Grammars (CDGs). CDGs are classical categorial gr
Externí odkaz:
https://doaj.org/article/ba9d9ef03c7a440aa501c34f526f828d
Autor:
Sergey M. Dudakov, Boris Karlov
Publikováno v:
Theory of Computing Systems. 65:462-478
This paper is dedicated to studying decidability properties of theories of regular languages with classical operations: union, concatenation, and the Kleene star. The theory with union only is a theory of some Boolean algebra, so it is decidable. We
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f1f8479c140aa08d5dbbd5a66e196193
https://doi.org/10.1007/s00224-020-09995-4
https://doi.org/10.1007/s00224-020-09995-4
Autor:
Alexey Naimushin, Boris Karlov
Publikováno v:
Herald of Tver State University. Series: Applied Mathematics. :85-98
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::21712c7be318b7a9d8d0d7abaa511900
https://doi.org/10.26456/vtpmk496
https://doi.org/10.26456/vtpmk496
Autor:
Boris Karlov
Publikováno v:
Herald of Tver State University. Series: Applied Mathematics. :7-23
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be96131b1882462cad73d3cf8af714e6
https://doi.org/10.26456/vtpmk185
https://doi.org/10.26456/vtpmk185
Autor:
Boris Karlov, Sergey M. Dudakov
Publikováno v:
Computer Science – Theory and Applications ISBN: 9783030199548
CSR
CSR
This paper is dedicated to studying decidability properties of some regular languages theories. We prove that the regular languages theory with the Kleene star only is decidable. If we use union and concatenation simultaneously then the theory become
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5382a8a9d5e31e31769c3b6de662ba62
https://doi.org/10.1007/978-3-030-19955-5_11
https://doi.org/10.1007/978-3-030-19955-5_11
Publikováno v:
Theoretical Computer Science. 579:33-63
Categorial Dependency Grammars (CDGs) are classical categorial grammars extended by oriented polarized valencies. At the same time, CDGs represent a class of completely lexicalized dependency grammars. They express both projective and non-projective
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb7d0fb1d62288f1a42509c54d84f905
https://doi.org/10.1016/j.tcs.2015.01.043
https://doi.org/10.1016/j.tcs.2015.01.043
Publikováno v:
Formal Grammar ISBN: 9783642320231
FG
FG
Categorial Dependency Grammars (CDG) is a class of simple and expressive categorial grammars defining projective and discontinuous dependency structures in a strongly compositional way. They are more expressive than CF-grammars, are polynomial time r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62ca593832edec25c333b3298228a99b
https://doi.org/10.1007/978-3-642-32024-8_5
https://doi.org/10.1007/978-3-642-32024-8_5
Autor:
Boris Karlov
Publikováno v:
Logical Aspects of Computational Linguistics ISBN: 9783642312618
LACL
LACL
Categorial Dependency Grammars (CDG) studied in this paper are categorial grammars expressing projective and discontinuous dependencies, stronger than cf-grammars and presumably nonequivalent to mild context-sensitive grammars. We define a normal for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d5bf74760ae261f861d5fcc6eb8608d5
https://doi.org/10.1007/978-3-642-31262-5_6
https://doi.org/10.1007/978-3-642-31262-5_6