scientific article; zbMATH DE number 5050046
From MaRDI portal
Publication:5482599
zbMath1096.68084MaRDI QIDQ5482599
Petr Sosík, Lila Kari, Gabriel Thierrin, Elena Losseva, Stavros Konstantinidis
Publication date: 28 August 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Protein sequences, DNA sequences (92D20)
Related Items (8)
Iterated Hairpin Completions of Non-crossing Words ⋮ Hairpin Lengthening and Shortening of Regular Languages ⋮ Decidability of involution hypercodes ⋮ Testing DNA code words properties of regular languages ⋮ Pseudo-inversion: closure properties and decidability ⋮ Hairpin structures defined by DNA trajectories ⋮ An extension of the Lyndon-Schützenberger result to pseudoperiodic words ⋮ On decidability and closure properties of language classes with respect to bio-operations
This page was built for publication: