| Publication | Date of Publication | Type |
|---|
Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids
Theoretical Computer Science | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 2102758 (Why is no real title available?) | 2004-09-24 | Paper |
| scientific article; zbMATH DE number 2068875 (Why is no real title available?) | 2004-05-27 | Paper |
Regular binoid expressions and regular binoid languages.
Theoretical Computer Science | 2003-08-17 | Paper |
Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language \(R \) with \(R_{1}\subseteq R\subseteq R_{2}\) for given regular languages \(R_{1},R_{2}\).
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 2015537 (Why is no real title available?) | 2003-01-01 | Paper |
DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA
International Journal of Algebra and Computation | 2002-12-15 | Paper |
| scientific article; zbMATH DE number 1788642 (Why is no real title available?) | 2002-08-26 | Paper |
On the shapes of vertex subsets of hypercubes that minimize their boundary
RIMS Kokyuroku | 2001-09-23 | Paper |
| scientific article; zbMATH DE number 1502105 (Why is no real title available?) | 2000-09-04 | Paper |
New upper bounds to the limitedness of distance automata
Theoretical Computer Science | 2000-08-23 | Paper |
| scientific article; zbMATH DE number 1322323 (Why is no real title available?) | 1999-11-08 | Paper |
The infinite 2-star height hierarchy of extended regular languages of star degree at most two
Information and Computation | 1995-01-11 | Paper |
| scientific article; zbMATH DE number 176770 (Why is no real title available?) | 1993-05-18 | Paper |
String matching problems over free partially commutative monoids
Information and Computation | 1993-05-16 | Paper |
Extended regular expressions of arbitrary star degrees
Theoretical Computer Science | 1992-09-27 | Paper |
Two recognizable string-matching problems over free partially commutative monoids
Theoretical Computer Science | 1992-09-26 | Paper |
Algorithms for determining relative inclusion star height and inclusion star height
Theoretical Computer Science | 1992-06-28 | Paper |
Recognizable closures and submonoids of free partially commutative monoids
Theoretical Computer Science | 1992-06-26 | Paper |
The double reconstruction conjecture about finite colored hypergraphs
Journal of Combinatorial Theory. Series B | 1992-01-01 | Paper |
Extended automata-like regular expressions of star degree at most (2,1)
Theoretical Computer Science | 1991-01-01 | Paper |
Improved limitedness theorems on finite automata with distance functions
Theoretical Computer Science | 1990-01-01 | Paper |
Extended regular expressions of star degree at most two
Theoretical Computer Science | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4213459 (Why is no real title available?) | 1990-01-01 | Paper |
Algorithms for determining relative star height and star height
Information and Computation | 1988-01-01 | Paper |
Notes on congruence relations and factor pumping conditions for rational languages
Theoretical Computer Science | 1988-01-01 | Paper |
Notes on finitely generated semigroups and pumping conditions for regular languages
Theoretical Computer Science | 1986-01-01 | Paper |
A decision procedure for the order of regular events
Theoretical Computer Science | 1979-01-01 | Paper |
