| Publication | Date of Publication | Type |
|---|
Comparing descriptional and computational complexity of infinite words
Lecture Notes in Computer Science | 2024-01-29 | Paper |
Toeplitz words, generalized periodicity and periodically iterated morphisms
Lecture Notes in Computer Science | 2023-12-12 | Paper |
Systems of equations over a finite set of words and automata theory
Word Equations and Related Topics | 2023-08-14 | Paper |
Regularity of k-Abelian Equivalence Classes of Fixed Cardinality
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
Pattern-matching problems for 2-dimensional images described by finite automata
Fundamentals of Computation Theory | 2022-12-09 | Paper |
On computational power of weighted finite automata
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
On the size of independent systems of equations in semigroups
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
Iterative devices generating infinite words
STACS 92 | 2022-08-18 | Paper |
On the equivalence problem for deterministic multitape automata and transducers
STACS 89 | 2022-08-16 | Paper |
Finite transducers and rational transductions
| 2022-02-04 | Paper |
Finite automata, image manipulation, and automatic real functions
| 2021-11-12 | Paper |
Roots and powers in regular languages: recognizing nonregular properties by finite automata
Fundamenta Informaticae | 2021-05-20 | Paper |
On Abelian Closures of Infinite Non-binary Words
| 2020-12-29 | Paper |
A compactness property of the \(k\)-abelian monoids
Theoretical Computer Science | 2020-08-17 | Paper |
On abelian saturated infinite words
Theoretical Computer Science | 2019-10-07 | Paper |
Compactness of systems of equations in semigroups
Automata, Languages and Programming | 2019-01-10 | Paper |
On abelian subshifts
| 2018-11-22 | Paper |
Degrees of infinite words, polynomials and atoms
International Journal of Foundations of Computer Science | 2018-09-20 | Paper |
The expressibility of languages and relations by word equations
Automata, Languages and Programming | 2018-07-04 | Paper |
On \(k\)-abelian palindromes
Information and Computation | 2018-05-30 | Paper |
\(k\)-abelian equivalence and rationality
Fundamenta Informaticae | 2018-01-19 | Paper |
Remarks on generalized Post Correspondence Problem
STACS 96 | 2017-11-16 | Paper |
On growth and fluctuation of \(k\)-abelian complexity
European Journal of Combinatorics | 2017-08-31 | Paper |
Variations of the Morse-Hedlund theorem for \(k\)-abelian equivalence
Acta Cybernetica | 2017-08-25 | Paper |
On cardinalities of \(k\)-abelian equivalence classes
Theoretical Computer Science | 2016-12-19 | Paper |
\(k\)-abelian equivalence and rationality
Developments in Language Theory | 2016-08-30 | Paper |
Degrees of Infinite Words, Polynomials and Atoms
Developments in Language Theory | 2016-08-30 | Paper |
On growth and fluctuation of \(k\)-abelian complexity
Lecture Notes in Computer Science | 2015-10-20 | Paper |
On the determinization blowup for finite automata recognizing equal-length languages
Computing with New Resources | 2015-09-08 | Paper |
Reachability via cooperating morphisms
Electronic Notes in Theoretical Computer Science | 2015-03-23 | Paper |
Variations of the Morse-Hedlund theorem for \(k\)-abelian equivalence
Developments in Language Theory | 2014-10-14 | Paper |
On k-Abelian Palindromic Rich and Poor Words
Developments in Language Theory | 2014-10-14 | Paper |
Fine and Wilf's theorem for \(k\)-abelian periods
International Journal of Foundations of Computer Science | 2014-08-04 | Paper |
On maximal chains of systems of word equations
Proceedings of the Steklov Institute of Mathematics | 2014-08-04 | Paper |
Noneffective regularity of equality languages and bounded delay morphisms
| 2014-05-06 | Paper |
On unavoidability of \(k\)-abelian squares in pure morphic words
| 2014-03-24 | Paper |
On a generalization of abelian equivalence and complexity of infinite words
Journal of Combinatorial Theory. Series A | 2014-01-06 | Paper |
On \(k\)-abelian avoidability
Journal of Mathematical Sciences (New York) | 2013-11-04 | Paper |
Fine and Wilf's theorem for \(k\)-abelian periods
Developments in Language Theory | 2012-11-02 | Paper |
Equations in the partial semigroup of words with overlapping products
Lecture Notes in Computer Science | 2012-11-01 | Paper |
Problems in between words and abelian words: \(k\)-abelian avoidability
Theoretical Computer Science | 2012-10-11 | Paper |
On abelian versions of critical factorization theorem
RAIRO. Theoretical Informatics and Applications | 2012-08-31 | Paper |
Preface
Theoretical Computer Science | 2012-05-30 | Paper |
scientific article; zbMATH DE number 5976065 (Why is no real title available?)
| 2011-11-22 | Paper |
The Unique Decipherability in the Monoid of Regular Languages is Undecidable
Fundamenta Informaticae | 2011-11-22 | Paper |
Locally catenative sequences and turtle graphics
RAIRO - Theoretical Informatics and Applications | 2011-10-28 | Paper |
Unique decipherability in the monoid of languages: an application of rational relations
Theory of Computing Systems | 2011-10-11 | Paper |
Weighted finite automata: Computing with different topologies
Lecture Notes in Computer Science | 2011-06-17 | Paper |
Local squares, periodicity and finite automata
Lecture Notes in Computer Science | 2011-05-27 | Paper |
Observations and Problems on k-abelian avoidability
| 2011-04-21 | Paper |
Computational power of two stacks with restricted communication
Information and Computation | 2010-10-07 | Paper |
Tiling periodicity
| 2010-07-27 | Paper |
Post correspondence problem for short words
Information Processing Letters | 2010-06-09 | Paper |
Automata on Words
Implementation and Application of Automata | 2010-05-07 | Paper |
On stateless multihead automata: hierarchies and the emptiness problem
Theoretical Computer Science | 2010-02-05 | Paper |
Intricacies of simple word equations: an example
International Journal of Foundations of Computer Science | 2010-01-29 | Paper |
Computing partial information out of intractable: powers of algebraic numbers as an example
Journal of Number Theory | 2010-01-08 | Paper |
ON THE POWER OF COOPERATING MORPHISMS VIA REACHABILITY PROBLEMS
International Journal of Foundations of Computer Science | 2009-11-19 | Paper |
scientific article; zbMATH DE number 5604082 (Why is no real title available?)
| 2009-09-15 | Paper |
Unique Decipherability in the Monoid of Languages: An Application of Rational Relations
Computer Science - Theory and Applications | 2009-08-18 | Paper |
Conjugacy of finite biprefix codes
Theoretical Computer Science | 2009-06-04 | Paper |
Aspects of Molecular Computing
Lecture Notes in Computer Science | 2009-05-14 | Paper |
MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM
International Journal of Algebra and Computation | 2009-02-10 | Paper |
An Analysis and a Reproof of Hmelevskii’s Theorem
Developments in Language Theory | 2008-10-30 | Paper |
Binary operations on automatic functions
RAIRO - Theoretical Informatics and Applications | 2008-07-29 | Paper |
Tiling Periodicity
Combinatorial Pattern Matching | 2008-06-17 | Paper |
ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS
International Journal of Foundations of Computer Science | 2008-05-20 | Paper |
On Stateless Multihead Automata: Hierarchies and the Emptiness Problem
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Communication of Two Stacks and Rewriting
Automata, Languages and Programming | 2007-09-11 | Paper |
Extension of the decidability of the marked PCP to instances with unique blocks
Theoretical Computer Science | 2007-07-16 | Paper |
The structure of infinite solutions of marked and binary Post correspondence problems
Theory of Computing Systems | 2007-02-14 | Paper |
scientific article; zbMATH DE number 5074397 (Why is no real title available?)
| 2006-11-21 | Paper |
Computing by commuting.
Theoretical Computer Science | 2006-05-18 | Paper |
Machines, Computations, and Universality
Lecture Notes in Computer Science | 2005-12-08 | Paper |
The Equivalence Problem of Finite Substitutions on ab*c, with Applications
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
Commutation with codes
Theoretical Computer Science | 2005-08-01 | Paper |
scientific article; zbMATH DE number 2185641 (Why is no real title available?)
| 2005-07-04 | Paper |
On the complexity of decidable cases of the commutation problem of languages
Theoretical Computer Science | 2005-06-30 | Paper |
A NOTE ON SYNCHRONIZED AUTOMATA AND ROAD COLORING PROBLEM
International Journal of Foundations of Computer Science | 2005-06-22 | Paper |
Some decision problems on integer matrices
RAIRO - Theoretical Informatics and Applications | 2005-06-07 | Paper |
Commutation with ternary sets of words
Theory of Computing Systems | 2005-04-19 | Paper |
scientific article; zbMATH DE number 2155195 (Why is no real title available?)
| 2005-04-11 | Paper |
scientific article; zbMATH DE number 2155196 (Why is no real title available?)
| 2005-04-11 | Paper |
scientific article; zbMATH DE number 2150291 (Why is no real title available?)
| 2005-03-30 | Paper |
scientific article; zbMATH DE number 2149521 (Why is no real title available?)
| 2005-03-30 | Paper |
A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\)
Information and Computation | 2004-11-23 | Paper |
Many aspects of defect theorems
Theoretical Computer Science | 2004-10-01 | Paper |
scientific article; zbMATH DE number 2087221 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2087489 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2086673 (Why is no real title available?)
| 2004-08-11 | Paper |
Polynomial versus exponential growth in repetition-free binary words
Journal of Combinatorial Theory. Series A | 2004-08-06 | Paper |
Decidability of the binary infinite Post Correspondence Problem
Discrete Applied Mathematics | 2003-09-22 | Paper |
scientific article; zbMATH DE number 1962803 (Why is no real title available?)
| 2003-08-11 | Paper |
Defect theorems for trees
| 2003-07-09 | Paper |
On the complexity of computing the order of repetition of a string
| 2003-06-26 | Paper |
The expressibility of languages and relations by word equations
Journal of the ACM | 2003-06-25 | Paper |
scientific article; zbMATH DE number 1929948 (Why is no real title available?)
| 2003-06-18 | Paper |
scientific article; zbMATH DE number 1929925 (Why is no real title available?)
| 2003-06-18 | Paper |
Some decision problems concerning semilinearity and commutation.
Journal of Computer and System Sciences | 2003-05-14 | Paper |
scientific article; zbMATH DE number 1836425 (Why is no real title available?)
| 2003-05-12 | Paper |
Locally periodic versus globally periodic infinite words
Journal of Combinatorial Theory. Series A | 2003-03-26 | Paper |
The complexity of compressing subsegments of images described by finite automata
Discrete Applied Mathematics | 2003-03-09 | Paper |
Conway's problem and the commutation of languages.
Bulletin of the European Association for Theoretical Computer Science EATCS | 2003-02-04 | Paper |
A defect theorem for bi-infinite words.
Theoretical Computer Science | 2003-01-22 | Paper |
Conway's problem for three-word sets.
Theoretical Computer Science | 2003-01-21 | Paper |
Communication complexity method for measuring nondeterminism in finite automata
Information and Computation | 2003-01-14 | Paper |
A short biography of Arto Salomaa
Information and Computation | 2003-01-14 | Paper |
scientific article; zbMATH DE number 1839444 (Why is no real title available?)
| 2002-12-02 | Paper |
scientific article; zbMATH DE number 1839428 (Why is no real title available?)
| 2002-12-02 | Paper |
On Conjugacy of Languages
RAIRO - Theoretical Informatics and Applications | 2002-09-18 | Paper |
The commutation of finite sets: A challenging problem
Theoretical Computer Science | 2002-07-15 | Paper |
Multiple factorizations of words and defect effect
Theoretical Computer Science | 2002-07-15 | Paper |
scientific article; zbMATH DE number 1754622 (Why is no real title available?)
| 2002-06-12 | Paper |
scientific article; zbMATH DE number 1738654 (Why is no real title available?)
| 2002-05-07 | Paper |
On the expressibility of languages by word equations with a bounded number of variables
Bulletin of the Belgian Mathematical Society - Simon Stevin | 2002-01-14 | Paper |
scientific article; zbMATH DE number 1688379 (Why is no real title available?)
| 2002-01-09 | Paper |
scientific article; zbMATH DE number 1670850 (Why is no real title available?)
| 2001-12-06 | Paper |
scientific article; zbMATH DE number 1670824 (Why is no real title available?)
| 2001-11-11 | Paper |
Some open problems in combinatorics of words and related areas
RIMS Kokyuroku | 2001-09-23 | Paper |
scientific article; zbMATH DE number 1496854 (Why is no real title available?)
| 2001-04-19 | Paper |
ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS
International Journal of Algebra and Computation | 2000-11-07 | Paper |
scientific article; zbMATH DE number 1522559 (Why is no real title available?)
| 2000-10-30 | Paper |
A short biography of Arto Salomaa
Theoretical Computer Science | 2000-08-23 | Paper |
scientific article; zbMATH DE number 1408327 (Why is no real title available?)
| 2000-04-03 | Paper |
scientific article; zbMATH DE number 1408337 (Why is no real title available?)
| 2000-02-29 | Paper |
scientific article; zbMATH DE number 1339955 (Why is no real title available?)
| 1999-11-23 | Paper |
scientific article; zbMATH DE number 1339965 (Why is no real title available?)
| 1999-09-22 | Paper |
Generalized factorizations of words and their algorithmic properties
Theoretical Computer Science | 1999-06-21 | Paper |
scientific article; zbMATH DE number 1222603 (Why is no real title available?)
| 1999-06-21 | Paper |
Examples of undecidable problems for 2-generator matrix semigroups
Theoretical Computer Science | 1999-01-12 | Paper |
scientific article; zbMATH DE number 1223721 (Why is no real title available?)
| 1998-11-15 | Paper |
scientific article; zbMATH DE number 1086497 (Why is no real title available?)
| 1998-11-03 | Paper |
ITERATIVE DEVICES GENERATING INFINITE WORDS
International Journal of Foundations of Computer Science | 1998-11-02 | Paper |
A note on decidability questions on presentations of word semigroups
Theoretical Computer Science | 1998-07-22 | Paper |
Compactness of Systems of Equations in Semigroups
International Journal of Algebra and Computation | 1998-02-25 | Paper |
scientific article; zbMATH DE number 1047888 (Why is no real title available?)
| 1997-11-24 | Paper |
On continuous functions computed by finite automata
RAIRO - Theoretical Informatics and Applications | 1997-10-30 | Paper |
Toeplitz words, generalized periodicity and periodically iterated morphisms
European Journal of Combinatorics | 1997-08-07 | Paper |
On the size of independent systems of equations in semigroups
Theoretical Computer Science | 1997-02-27 | Paper |
scientific article; zbMATH DE number 871243 (Why is no real title available?)
| 1996-08-22 | Paper |
Polynomial size test sets for context-free languages
Journal of Computer and System Sciences | 1996-03-18 | Paper |
Finite Automata Computing Real Functions
SIAM Journal on Computing | 1994-10-17 | Paper |
Efficient constructions of test sets for regular and context-free languages
Theoretical Computer Science | 1993-10-25 | Paper |
Equations over finite sets of words and equivalence problems in automata theory
Theoretical Computer Science | 1993-10-17 | Paper |
scientific article; zbMATH DE number 176926 (Why is no real title available?)
| 1993-05-18 | Paper |
scientific article; zbMATH DE number 176145 (Why is no real title available?)
| 1993-05-18 | Paper |
Multiplicities: A deterministic view of nondeterminism
Theoretical Computer Science | 1992-09-27 | Paper |
scientific article; zbMATH DE number 17800 (Why is no real title available?)
| 1992-06-26 | Paper |
The equivalence problem of multitape finite automata
Theoretical Computer Science | 1991-01-01 | Paper |
On the power of synchronization in parallel computations
Discrete Applied Mathematics | 1991-01-01 | Paper |
Loops in automata and HDTOL relations
RAIRO - Theoretical Informatics and Applications | 1990-01-01 | Paper |
HDTOL matching of computations of multitape automata
Acta Informatica | 1989-01-01 | Paper |
On totalistic systolic networks
Information Processing Letters | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4090810 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4058892 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4033111 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4028926 (Why is no real title available?)
| 1987-01-01 | Paper |
The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDTOL Languages) is Decidable
SIAM Journal on Computing | 1987-01-01 | Paper |
scientific article; zbMATH DE number 4045192 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4039335 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4045201 (Why is no real title available?)
| 1987-01-01 | Paper |
The equivalence of finite valued transducers (on HDT0L languages) is decidable
Theoretical Computer Science | 1986-01-01 | Paper |
On the defect theorem and simplifiability
Semigroup Forum | 1986-01-01 | Paper |
scientific article; zbMATH DE number 3940751 (Why is no real title available?)
| 1986-01-01 | Paper |
Synchronizable deterministic pushdown automata and the decidability of their equivalence
Acta Informatica | 1986-01-01 | Paper |
A simple undecidable problem: Existential agreement of inverses of two morphisms on a regular language
Journal of Computer and System Sciences | 1986-01-01 | Paper |
On morphic generation of regular languages
Discrete Applied Mathematics | 1986-01-01 | Paper |
A note on the equivalence problem of rational formal power series
Information Processing Letters | 1986-01-01 | Paper |
scientific article; zbMATH DE number 4003554 (Why is no real title available?)
| 1986-01-01 | Paper |
On three-element codes
Theoretical Computer Science | 1985-01-01 | Paper |
A property of three-element codes
Theoretical Computer Science | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3970124 (Why is no real title available?)
| 1985-01-01 | Paper |
Test sets for morphisms with bounded delay
Discrete Applied Mathematics | 1985-01-01 | Paper |
The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids
Theoretical Computer Science | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3883635 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3878385 (Why is no real title available?)
| 1984-01-01 | Paper |
A note on intersections of free submonoids of a free monoid
Semigroup Forum | 1984-01-01 | Paper |
Inverse morphic equivalence on languages
Information Processing Letters | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3885311 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3874640 (Why is no real title available?)
| 1984-01-01 | Paper |
On cube-free \(\omega\)-words generated by binary morphisms
Discrete Applied Mathematics | 1983-01-01 | Paper |
On binary equality sets and a solution to the test set conjecture in the binary case
Journal of Algebra | 1983-01-01 | Paper |
Systems of equations over a free monoid and Ehrenfeucht's conjecture
Discrete Mathematics | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3866597 (Why is no real title available?)
| 1983-01-01 | Paper |
scientific article; zbMATH DE number 3876632 (Why is no real title available?)
| 1983-01-01 | Paper |
A note on morphic characterization of languages
Discrete Applied Mathematics | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3834275 (Why is no real title available?)
| 1983-01-01 | Paper |
Test sets for context free languages and algebraic systems of equations over a free monoid
Information and Control | 1982-01-01 | Paper |
The (generalized) Post correspondence problem with lists consisting of two words is decidable
Theoretical Computer Science | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3763321 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3856427 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3763322 (Why is no real title available?)
| 1982-01-01 | Paper |
On the equivalence problem for binary DOL systems
Information and Control | 1981-01-01 | Paper |
scientific article; zbMATH DE number 3723891 (Why is no real title available?)
| 1981-01-01 | Paper |
scientific article; zbMATH DE number 3750326 (Why is no real title available?)
| 1981-01-01 | Paper |
scientific article; zbMATH DE number 3723890 (Why is no real title available?)
| 1981-01-01 | Paper |
scientific article; zbMATH DE number 3710436 (Why is no real title available?)
| 1980-01-01 | Paper |
Generalized Parikh mappings and homomorphisms
Information and Control | 1980-01-01 | Paper |
On commutative DTOL systems
Theoretical Computer Science | 1979-01-01 | Paper |
Interactive L systems with almost interactionless behaviour
Information and Control | 1979-01-01 | Paper |
scientific article; zbMATH DE number 3714963 (Why is no real title available?)
| 1979-01-01 | Paper |
Remarks on commutative N-rational series
Theoretical Computer Science | 1978-01-01 | Paper |
A note on DOL length sets
Discrete Mathematics | 1978-01-01 | Paper |
scientific article; zbMATH DE number 3560773 (Why is no real title available?)
| 1977-01-01 | Paper |
Two theorems concerning recognizable \(N\)-subsets of \(\sigma^*\)
Theoretical Computer Science | 1976-01-01 | Paper |
scientific article; zbMATH DE number 3555497 (Why is no real title available?)
| 1976-01-01 | Paper |
scientific article; zbMATH DE number 3471632 (Why is no real title available?)
| 1974-01-01 | Paper |
scientific article; zbMATH DE number 3470030 (Why is no real title available?)
| 1974-01-01 | Paper |
An example of a PD2L-system with the growth type 2\({1 \over 2}\)
Information Processing Letters | 1973-01-01 | Paper |
