| Publication | Date of Publication | Type |
|---|
Improved randomized approximation of hard universality and emptiness problems
Journal of Automata, Languages and Combinatorics | 2025-11-25 | Paper |
Language quotients revisited
International Journal of Foundations of Computer Science | 2025-04-30 | Paper |
On the difference set of two transductions
Theoretical Computer Science | 2024-10-07 | Paper |
Approximate NFA universality and related problems motivated by information theory
Theoretical Computer Science | 2023-09-07 | Paper |
Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
On the average complexity of partial derivative transducers
Theoretical Computer Science | 2023-04-26 | Paper |
Approximate NFA universality motivated by information theory
(available as arXiv preprint) | 2023-01-18 | Paper |
| Theoretical and implementational aspects of the formal language server (LaSer) | 2022-12-16 | Paper |
| Partial derivative automaton by compressing regular expressions | 2022-11-09 | Paper |
On the size of partial derivatives and the word membership problem
Acta Informatica | 2021-07-23 | Paper |
Partial derivatives of regular expressions over alphabet-invariant and user-defined labels
Theoretical Computer Science | 2021-06-03 | Paper |
| Every regular bifix code is a finite union of regular infix codes | 2021-05-12 | Paper |
Regular expressions and transducers over alphabet-invariant and user-defined labels
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
On the average state complexity of partial derivative transducers
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
Partitioning a symmetric rational relation into two asymmetric rational relations
(available as arXiv preprint) | 2020-05-06 | Paper |
Partial derivatives of regular expressions over alphabet-invariant and user-defined labels
Implementation and Application of Automata | 2020-05-06 | Paper |
Power of the Wilcoxon–Mann–Whitney test for non‐inferiority in the presence of death‐censored observations
Biometrical Journal | 2020-01-15 | Paper |
Randomized generation of error control codes with automata and transducers
RAIRO - Theoretical Informatics and Applications | 2019-07-18 | Paper |
Efficient algorithms for computing the inner edit distance of a regular language via transducers
Algorithms | 2019-01-21 | Paper |
Variable-length codes for error correction
Automata, Languages and Programming | 2019-01-10 | Paper |
Regular expressions and transducers over alphabet-invariant and user-defined labels
(available as arXiv preprint) | 2018-11-07 | Paper |
Symbolic manipulation of code properties
(available as arXiv preprint) | 2018-09-17 | Paper |
Transducer descriptions of DNA code properties and undecidability of antimorphic problems
Information and Computation | 2018-03-21 | Paper |
Embedding rationally independent languages into maximal ones
(available as arXiv preprint) | 2017-11-20 | Paper |
| Applications of transducers in independent languages, word distances, codes | 2017-08-31 | Paper |
Implementation of code properties via transducers
Implementation and Application of Automata | 2016-11-09 | Paper |
f-words and binary solid codes
Journal of Automata, Languages and Combinatorics | 2016-09-29 | Paper |
Computing maximal Kleene closures that are embeddable in a given subword-closed language
Natural Computing | 2016-03-10 | Paper |
Transducer descriptions of DNA code properties and undecidability of antimorphic problems
Lecture Notes in Computer Science | 2015-08-07 | Paper |
On the maximality of languages with combined types of code properties
Theoretical Computer Science | 2014-08-26 | Paper |
Formal descriptions of code properties: decidability, complexity, implementation
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
Computing maximal Kleene closures that are embeddable in a given constrained DNA language
Lecture Notes in Computer Science | 2011-09-16 | Paper |
Computing maximal error-detecting capabilities and distances of regular languages
Fundamenta Informaticae | 2011-06-14 | Paper |
On implementing recognizable transductions
International Journal of Computer Mathematics | 2010-01-26 | Paper |
State-complexity hierarchies of uniform languages of alphabet-size length
Theoretical Computer Science | 2009-08-07 | Paper |
On the definition of stochastic λ-transducers
International Journal of Computer Mathematics | 2009-07-23 | Paper |
Hairpin Structures in DNA Words
DNA Computing | 2009-04-02 | Paper |
| Maximal error-detecting capabilities of formal languages | 2009-01-15 | Paper |
STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING
International Journal of Foundations of Computer Science | 2008-12-01 | Paper |
DNA Coding Using the Subword Closure Operation
DNA Computing | 2008-04-04 | Paper |
| Error-correction, and finite-delay decodability | 2007-10-17 | Paper |
Computing the edit distance of a regular language
Information and Computation | 2007-09-18 | Paper |
| Fuzzification of rational and recognizable sets | 2007-07-24 | Paper |
Representation and uniformization of algebraic transductions
Acta Informatica | 2007-01-05 | Paper |
DNA Computing
Lecture Notes in Computer Science | 2006-10-19 | Paper |
DNA Computing
Lecture Notes in Computer Science | 2006-10-19 | Paper |
| A formal language analysis of DNA hairpin structures | 2006-08-28 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2006-06-23 | Paper |
(Near-)inverses of sequences
International Journal of Computer Mathematics | 2006-05-22 | Paper |
BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS
International Journal of Foundations of Computer Science | 2005-11-14 | Paper |
| scientific article; zbMATH DE number 2201366 (Why is no real title available?) | 2005-09-01 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2005-08-17 | Paper |
OPERATIONS ON TRAJECTORIES WITH APPLICATIONS TO CODING AND BIOINFORMATICS
International Journal of Foundations of Computer Science | 2005-08-01 | Paper |
On properties of bond-free DNA languages
Theoretical Computer Science | 2005-06-01 | Paper |
On a simple method for detecting synchronization errors in coded messages
IEEE Transactions on Information Theory | 2005-06-01 | Paper |
| scientific article; zbMATH DE number 2143014 (Why is no real title available?) | 2005-03-08 | Paper |
Language equations, maximality and error-detection
Journal of Computer and System Sciences | 2005-02-23 | Paper |
Theory Is Forever
Lecture Notes in Computer Science | 2005-01-18 | Paper |
Sticky-free and overhang-free DNA languages
Acta Informatica | 2004-12-09 | Paper |
| scientific article; zbMATH DE number 2087007 (Why is no real title available?) | 2004-08-11 | Paper |
Coding properties of DNA languages.
Theoretical Computer Science | 2003-08-17 | Paper |
An algebra of discrete channels that involve combinations of three basic error types
Information and Computation | 2003-01-14 | Paper |
Relationships between different error-correcting capabilities of a code
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Error-detecting properties of languages
Theoretical Computer Science | 2002-07-15 | Paper |
Maximal solid codes
Journal of Automata, Languages and Combinatorics | 2001-04-17 | Paper |
Structural analysis of error-correcting codes for discrete channels that involve combinations of three basic error types
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Error correction for channels with substitutions, insertions, and deletions
Information Theory and Applications II | 1998-02-08 | Paper |
| scientific article; zbMATH DE number 522835 (Why is no real title available?) | 1994-03-24 | Paper |
