Search for Author All Reviews
	Harju, Tero     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 4 of 4 reviews       Counting bordered and primitive words with a fixed weight Harju T., Nowotka D. Theoretical Computer Science 340(2): 273-279, 2005.  Type: Article A word w is primitive if w cannot be written in the form uk for any k greater than 1, and w is bordered if some proper prefix of ...... Jul 10 2006     Equality sets of prefix morphisms and regular star languages Halava V., Harju T., Latteux M. Information Processing Letters 94(4): 151-154, 2005.  Type: Article This paper continues a long line of research in formal language theory into morphic representations for classes of languages. The paper is mainly concerned with showing that a language L ⊆...... Sep 28 2005     Computation in living cells: gene assembly in ciliates (Natural Computing Series) Ehrenfeucht A., Harju T., Petre I., Springer-Verlag, 2004.  Type: Book (9783540407959) Adleman, from the University of Southern California, used the tools of molecular biology to solve a small, seven nodes instance of the combinatorial search problem, known as the Hamiltonian path problem. He encoded a small graph in mol...... Nov 5 2004     The &ohgr;-Sequence Problem for DOL Systems Is Decidable. Karel I., Harju T. Journal of the ACM 31(2): 282-298, 1984.  Type: Article This paper solves the decision problem in the title. Let &Sgr; be an alphabet and &sgr;1,&sgr;2:9I &sgr;*. The question is to decide whether iterated application of prefix-preserving h...... Feb 1 1985
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy