| Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations. | 0 | 0.34 | 2019 |
| Partial Derivatives of Regular Expressions over Alphabet-Invariant and User-Defined Labels. | 0 | 0.34 | 2019 |
| Randomized generation of error control codes with automata and transducers. | 0 | 0.34 | 2018 |
| Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers. | 0 | 0.34 | 2018 |
| Applications Of Transducers In Independent Languages, Word Distances, Codes | 0 | 0.34 | 2017 |
| Report on DCFS 2017. | 0 | 0.34 | 2017 |
| Channels with Synchronization/Substitution Errors and Computation of Error Control Codes. | 2 | 0.46 | 2016 |
| Additive methods for genomic signatures. | 1 | 0.35 | 2016 |
| Implementation Of Code Properties Via Transducers | 4 | 0.55 | 2016 |
| Generating error control codes with automata and transducers. | 1 | 0.35 | 2016 |
| An investigation into inter- and intragenomic variations of graphic genomic signatures | 6 | 0.76 | 2015 |
| Embedding rationally independent languages into maximal ones | 1 | 0.35 | 2015 |
| An efficient algorithm for computing the edit distance of a regular language via input-altering transducers. | 4 | 0.44 | 2014 |
| On the maximality of languages with combined types of code properties | 1 | 0.37 | 2014 |
| Computing maximal Kleene closures that are embeddable in a given subword-closed language | 0 | 0.34 | 2013 |
| Implementation and Application of Automata - 18th International Conference, CIAA 2013, Halifax, NS, Canada, July 16-19, 2013. Proceedings | 31 | 1.88 | 2013 |
| Formal Descriptions Of Code Properties: Decidability, Complexity, Implementation | 10 | 0.87 | 2012 |
| Computing maximal Kleene closures that are embeddable in a given constrained DNA language | 1 | 0.37 | 2011 |
| Computing Maximal Error-detecting Capabilities and Distances of Regular Languages | 7 | 0.59 | 2010 |
| f-Words and Binary Solid Codes. | 0 | 0.34 | 2010 |
| On The Definition Of Stochastic -Transducers | 0 | 0.34 | 2009 |
| State Complexity Of The Subword Closure Operation With Applications To Dna Coding | 3 | 0.46 | 2008 |
| State-complexity hierarchies of uniform languages of alphabet-size length | 1 | 0.35 | 2008 |
| What is a maximal error-detecting capability of a formal language? | 0 | 0.34 | 2008 |
| Computing the edit distance of a regular language | 14 | 0.92 | 2007 |
| Representation and uniformization of algebraic transductions | 4 | 0.46 | 2007 |
| DNA coding using the subword closure operation | 3 | 0.58 | 2007 |
| Fuzzification of Rational and Recognizable Sets | 8 | 0.46 | 2007 |
| (Near-)Inverses Of Sequences | 1 | 0.43 | 2006 |
| On properties of bond-free DNA languages | 15 | 0.90 | 2005 |
| Hairpin structures in DNA words | 17 | 1.07 | 2005 |
| On hairpin-free words and languages | 14 | 1.54 | 2005 |
| Operations On Trajectories With Applications To Coding And Bioinformatics | 2 | 0.39 | 2005 |
| Language equations, maximality and error-detection | 13 | 0.91 | 2005 |
| Bond-free languages: formalizations, maximality and construction methods | 0 | 0.34 | 2004 |
| Substitutions, trajectories and noisy channels | 3 | 0.43 | 2004 |
| Preventing undesirable bonds between DNA codewords | 5 | 0.54 | 2004 |
| Asymptotically Optimal Low-Cost Solid Codes | 4 | 0.68 | 2004 |
| Substitution on Trajectories | 3 | 0.40 | 2004 |
| Coding properties of DNA languages | 33 | 2.05 | 2003 |
| Sticky-free and overhang-free DNA languages | 24 | 1.69 | 2003 |
| Error-Correction, and Finite-Delay Decodability | 4 | 0.46 | 2002 |
| Descriptional complexity of error/edit systems | 9 | 1.11 | 2002 |
| Error-detecting properties of languages | 6 | 0.87 | 2002 |
| An algebra of discrete channels that involve combinations of three basic errors types | 10 | 1.08 | 2001 |
| Error Corrections for Channels with Substitutions, Insertions, and Deletions | 7 | 0.88 | 1995 |
| Variable-Length Codes for Error Correction | 6 | 0.67 | 1995 |
| The Hierarchy of Codes | 5 | 0.71 | 1993 |
