Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Journal Article
%1 keyhere
%A Gabbasov, N.
%D 1995
%J Journal of Mathematical Sciences
%K codes decodability
%N 6
%P 1303--1305
%T Algorithmic ways of deciding whether an infinite language is a code
%U http://dx.doi.org/10.1007/BF02367716
%V 74
%X Without Abstract
ER -
@article{keyhere,
abstract = {Without Abstract
ER -},
added-at = {2009-01-25T22:44:15.000+0100},
author = {Gabbasov, N.},
biburl = {https://www.bibsonomy.org/bibtex/2d7a629c0750d7f18b08b0366d1aa20e8/krystian},
description = {SpringerLink - Journal Article},
interhash = {785b895fa8a6e891550938508b7e79c5},
intrahash = {d7a629c0750d7f18b08b0366d1aa20e8},
journal = {Journal of Mathematical Sciences},
keywords = {codes decodability},
month = {#may#},
number = 6,
pages = {1303--1305},
timestamp = {2009-01-25T22:44:15.000+0100},
title = {Algorithmic ways of deciding whether an infinite language is a code},
url = {http://dx.doi.org/10.1007/BF02367716},
volume = 74,
year = 1995
}
