| Publication | Date of Publication | Type |
|---|
Rediscovering pushdown machines
Lecture Notes in Computer Science | 2024-01-29 | Paper |
Complexity of E0L structural equivalence
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
Characterizing regular languages with polynomial densities
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
| State complexity of catenation combined with star and reversal | 2021-02-24 | Paper |
State complexity of catenation combined with star and reversal
(available as arXiv preprint) | 2021-02-24 | Paper |
| Transition complexity of incomplete DFAs | 2021-02-24 | Paper |
Transition complexity of incomplete DFAs
(available as arXiv preprint) | 2021-02-24 | Paper |
| scientific article; zbMATH DE number 7301304 (Why is no real title available?) | 2021-01-26 | Paper |
Inclusion is undecidable for pattern languages
Automata, Languages and Programming | 2019-03-29 | Paper |
A survey on operational state complexity
(available as arXiv preprint) | 2017-11-20 | Paper |
| Computing Supply Function Equilibria via Spline Approximations | 2015-02-02 | Paper |
| scientific article; zbMATH DE number 6300109 (Why is no real title available?) | 2014-06-03 | Paper |
Online scheduling of simple linear deteriorating jobs to minimize the total general completion time
Theoretical Computer Science | 2013-12-11 | Paper |
An optimal single-machine scheduling with linear deterioration rate and rate-modifying activities
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
Undecidability of state complexity
International Journal of Computer Mathematics | 2013-10-22 | Paper |
| Type theory and language constructs for objects with states | 2013-10-02 | Paper |
State complexity and approximation
International Journal of Foundations of Computer Science | 2013-01-18 | Paper |
State complexity of union and intersection of square and reversal on \(k\) regular languages
Theoretical Computer Science | 2012-10-11 | Paper |
State complexity of two combined operations: catenation-star and catenation-reversal
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
State complexity of combined operations with two basic operations
Theoretical Computer Science | 2012-08-08 | Paper |
Online makespan scheduling of linear deteriorating jobs on parallel machines
Lecture Notes in Computer Science | 2012-07-16 | Paper |
State complexity of combined operations with union, intersection, star and reversal
Fundamenta Informaticae | 2012-06-20 | Paper |
Derivatives of regular expressions and an application
Computation, Physics and Beyond | 2012-06-15 | Paper |
State complexity of union and intersection of star on \(k\) regular languages
Theoretical Computer Science | 2012-05-30 | Paper |
State complexity of two combined operations: catenation-union and catenation-intersection
International Journal of Foundations of Computer Science | 2012-03-13 | Paper |
A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time
Information Processing Letters | 2012-03-09 | Paper |
Transition complexity of incomplete DFAs
Fundamenta Informaticae | 2011-11-22 | Paper |
| Introducing the Adaptive Convex Enveloping | 2011-11-10 | Paper |
Optimal policy for single-machine scheduling with deterioration effects, learning effects, setup times, and availability constraints
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
Obituary: Derick Wood: always in our hearts
Implementation and Application of Automata | 2011-07-29 | Paper |
State complexity of four combined operations composed of union, intersection, star and reversal
Descriptional Complexity of Formal Systems | 2011-07-29 | Paper |
State complexity research and approximation
Developments in Language Theory | 2011-07-29 | Paper |
Undecidability of the state complexity of composed regular operations
Language and Automata Theory and Applications | 2011-06-03 | Paper |
State complexity of catenation combined with union and intersection
Implementation and Application of Automata | 2011-02-11 | Paper |
| Seventy years Derick Wood | 2010-09-22 | Paper |
Subword occurrences, Parikh matrices and Lyndon images
International Journal of Foundations of Computer Science | 2010-03-09 | Paper |
SC-expressions in object-oriented languages
International Journal of Foundations of Computer Science | 2010-01-29 | Paper |
On implementing recognizable transductions
International Journal of Computer Mathematics | 2010-01-26 | Paper |
Variants of codes and indecomposable languages
Information and Computation | 2009-11-27 | Paper |
| scientific article; zbMATH DE number 5605117 (Why is no real title available?) | 2009-09-19 | Paper |
Deciding determinism of caterpillar expressions
Theoretical Computer Science | 2009-09-14 | Paper |
Pattern expressions and pattern automata
Information Processing Letters | 2009-08-27 | Paper |
Hierarchy and equivalence of multi-letter quantum finite automata
Theoretical Computer Science | 2009-08-07 | Paper |
Estimation of state complexity of combined operations
Theoretical Computer Science | 2009-08-07 | Paper |
Are Statecharts Finite Automata?
Implementation and Application of Automata | 2009-07-09 | Paper |
State Complexity of Combined Operations for Prefix-Free Regular Languages
Language and Automata Theory and Applications | 2009-04-02 | Paper |
On Weakly Ambiguous Finite Transducers
Developments in Language Theory | 2009-03-26 | Paper |
Length Codes, Products of Languages and Primality
Language and Automata Theory and Applications | 2008-11-20 | Paper |
State complexity of basic language operations combined with reversal
Information and Computation | 2008-10-08 | Paper |
| scientific article; zbMATH DE number 5309908 (Why is no real title available?) | 2008-08-12 | Paper |
| The state complexity of two combined operations: star of catenation and star of reversal | 2008-06-11 | Paper |
Deterministic Caterpillar Expressions
Implementation and Application of Automata | 2008-06-10 | Paper |
| Additive distances and quasi-distances between words | 2007-10-17 | Paper |
State complexity of combined operations
Theoretical Computer Science | 2007-09-19 | Paper |
On the State Complexity of Combined Operations
Implementation and Application of Automata | 2007-09-06 | Paper |
| Fuzzification of rational and recognizable sets | 2007-07-24 | Paper |
On the existence of prime decompositions
Theoretical Computer Science | 2007-05-11 | Paper |
Subword conditions and subword histories
Information and Computation | 2007-01-22 | Paper |
Representation and uniformization of algebraic transductions
Acta Informatica | 2007-01-05 | Paper |
| Nondeterministic bimachines and rational relations with finite codomain | 2006-11-21 | Paper |
| Nondeterminism degrees for context-free languages | 2006-09-06 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
WORD COMPLEXITY AND REPETITIONS IN WORDS
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
| scientific article; zbMATH DE number 2182451 (Why is no real title available?) | 2005-06-23 | Paper |
AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES
International Journal of Foundations of Computer Science | 2005-06-22 | Paper |
| scientific article; zbMATH DE number 2162119 (Why is no real title available?) | 2005-04-28 | Paper |
| scientific article; zbMATH DE number 2155201 (Why is no real title available?) | 2005-04-11 | Paper |
| scientific article; zbMATH DE number 2150274 (Why is no real title available?) | 2005-03-30 | Paper |
Mergible states in large NFA
Theoretical Computer Science | 2005-02-22 | Paper |
Theory Is Forever
Lecture Notes in Computer Science | 2005-01-18 | Paper |
Subword histories and Parikh matrices
Journal of Computer and System Sciences | 2004-09-08 | Paper |
| scientific article; zbMATH DE number 2089987 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2087060 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2087235 (Why is no real title available?) | 2004-08-11 | Paper |
On the state complexity of reversals of regular languages
Theoretical Computer Science | 2004-08-10 | Paper |
| scientific article; zbMATH DE number 2081043 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2081044 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 1916664 (Why is no real title available?) | 2004-03-28 | Paper |
| scientific article; zbMATH DE number 2060759 (Why is no real title available?) | 2004-03-18 | Paper |
Follow automata.
Information and Computation | 2004-03-14 | Paper |
Reducing NFAs by invariant equivalences.
Theoretical Computer Science | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 2051175 (Why is no real title available?) | 2004-03-07 | Paper |
| scientific article; zbMATH DE number 1995125 (Why is no real title available?) | 2003-10-21 | Paper |
| scientific article; zbMATH DE number 1988969 (Why is no real title available?) | 2003-10-20 | Paper |
| scientific article; zbMATH DE number 1962812 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1962769 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1929949 (Why is no real title available?) | 2003-06-18 | Paper |
| scientific article; zbMATH DE number 1836419 (Why is no real title available?) | 2002-11-27 | Paper |
| scientific article; zbMATH DE number 1820028 (Why is no real title available?) | 2002-10-23 | Paper |
A sharpening of the Parikh mapping
RAIRO - Theoretical Informatics and Applications | 2002-09-18 | Paper |
A sharpening of the Parikh mapping
RAIRO - Theoretical Informatics and Applications | 2002-09-18 | Paper |
A sharpening of the Parikh mapping
RAIRO - Theoretical Informatics and Applications | 2002-09-18 | Paper |
Tree-systems of morphisms
Acta Informatica | 2002-08-14 | Paper |
| scientific article; zbMATH DE number 1773088 (Why is no real title available?) | 2002-07-28 | Paper |
Decidability of EDT0L structural equivalence
Theoretical Computer Science | 2002-07-15 | Paper |
On the robustness of primitive words
Discrete Applied Mathematics | 2002-05-15 | Paper |
Minimal cover-automata for finite languages
Theoretical Computer Science | 2002-03-03 | Paper |
Loop-free alternating finite automata
Publicationes Mathematicae Debrecen | 2002-02-13 | Paper |
State complexity of regular languages
Journal of Automata, Languages and Combinatorics | 2002-01-31 | Paper |
Generalized fairness and context-free languages
Acta Cybernetica | 2001-06-13 | Paper |
| scientific article; zbMATH DE number 1452984 (Why is no real title available?) | 2001-06-05 | Paper |
| On the decomposition of finite languages | 2001-04-04 | Paper |
| scientific article; zbMATH DE number 1543321 (Why is no real title available?) | 2001-02-27 | Paper |
| scientific article; zbMATH DE number 1747444 (Why is no real title available?) | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1342113 (Why is no real title available?) | 2000-10-17 | Paper |
| scientific article; zbMATH DE number 1408333 (Why is no real title available?) | 2000-09-26 | Paper |
| scientific article; zbMATH DE number 1501609 (Why is no real title available?) | 2000-09-04 | Paper |
Using DNA to solve the bounded Post correspondence problem
Theoretical Computer Science | 2000-08-23 | Paper |
Efficient implementation of regular languages using reversed alternating finite automata
Theoretical Computer Science | 2000-08-23 | Paper |
Alternating finite automata and star-free languages
Theoretical Computer Science | 2000-08-21 | Paper |
Pattern languages with and without erasing
International Journal of Computer Mathematics | 2000-07-04 | Paper |
Transducers and the decidability of independence in free monoids
Theoretical Computer Science | 2000-06-27 | Paper |
| scientific article; zbMATH DE number 1452982 (Why is no real title available?) | 2000-05-25 | Paper |
| scientific article; zbMATH DE number 1346507 (Why is no real title available?) | 1999-10-03 | Paper |
| scientific article; zbMATH DE number 1222112 (Why is no real title available?) | 1999-06-21 | Paper |
Synchronization expressions with extended join operation
Theoretical Computer Science | 1999-01-12 | Paper |
DNA computing, sticker systems, and universality
Acta Informatica | 1998-11-08 | Paper |
| scientific article; zbMATH DE number 1156489 (Why is no real title available?) | 1998-08-10 | Paper |
Physical versus computational complementarity. I
International Journal of Theoretical Physics | 1998-06-02 | Paper |
Language-theoretic complexity of disjunctive sequences
Discrete Applied Mathematics | 1998-03-25 | Paper |
| scientific article; zbMATH DE number 1086501 (Why is no real title available?) | 1997-11-13 | Paper |
Pumping and pushdown machines
RAIRO - Theoretical Informatics and Applications | 1997-10-30 | Paper |
Complexity of E0L structural equivalence
RAIRO - Theoretical Informatics and Applications | 1997-10-08 | Paper |
Structural equivalence and ET0L grammars
Theoretical Computer Science | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 1419231 (Why is no real title available?) | 1996-01-01 | Paper |
P, NP, and the Post correspondence problem
Information and Computation | 1995-11-14 | Paper |
Measures of nondeterminism for pushdown automata
Journal of Computer and System Sciences | 1995-10-09 | Paper |
| scientific article; zbMATH DE number 777294 (Why is no real title available?) | 1995-07-20 | Paper |
Decision problems for patterns
Journal of Computer and System Sciences | 1995-06-08 | Paper |
On sparse languages \(L\) such that \(LL= \Sigma^*\)
Discrete Applied Mathematics | 1994-09-27 | Paper |
| scientific article; zbMATH DE number 522868 (Why is no real title available?) | 1994-04-17 | Paper |
The state complexities of some basic operations on regular languages
Theoretical Computer Science | 1994-04-05 | Paper |
Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems
Discrete Applied Mathematics | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 10092 (Why is no real title available?) | 1992-06-25 | Paper |
Decidability of structural equivalence of E0L grammars
Theoretical Computer Science | 1991-01-01 | Paper |
Computation theoretic aspects of cellular automata
Physica D | 1990-01-01 | Paper |
Formal languages and global cellular automaton behavior
Physica D | 1990-01-01 | Paper |
The immortality problem for Lag systems
Information Processing Letters | 1990-01-01 | Paper |
A pumping lemma for deterministic context-free languages
Information Processing Letters | 1989-01-01 | Paper |
On the Limit Sets of Cellular Automata
SIAM Journal on Computing | 1989-01-01 | Paper |
Can the catenation of two weakly sparse languages be dense?
Discrete Applied Mathematics | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4074492 (Why is no real title available?) | 1988-01-01 | Paper |
Decision problems resulting from grammatical inference
Annales Academiae Scientiarum Fennicae Series A I Mathematica | 1987-01-01 | Paper |
Fault-tolerant schemes for some systolic systems
International Journal of Computer Mathematics | 1987-01-01 | Paper |
A property of real-time trellis automata
Discrete Applied Mathematics | 1986-01-01 | Paper |
On a public-key cryptosystem based on iterated morphisms and substitutions
Theoretical Computer Science | 1986-01-01 | Paper |
Real-time, pseudo real-time, and linear-time ITA
Theoretical Computer Science | 1986-01-01 | Paper |
Iterative tree arrays with logarithmic depth†
International Journal of Computer Mathematics | 1986-01-01 | Paper |
Iterative tree automata
Theoretical Computer Science | 1984-01-01 | Paper |
