|
СТ |
On Logically Defined Recognizable Tree Languages |
2003 |
Esik Z., Weil P. |
|
|
|
Lecture Notes in Computer Science |
30.01.2004 |
|
СТ |
The Equational Theory of Fixed Points with Applications to Generalized Language Theory |
2002 |
Esik Z. |
|
|
|
Lecture Notes in Computer Science |
31.05.2002 |
|
СТ |
Axiomatizing the Equational Theory of Regular Tree Languages |
1998 |
Esik Z. |
|
|
|
Lecture Notes in Computer Science |
31.03.1998 |
|
СТ |
Nonfinite Axiomatizability of Shuffle Inequalities |
1995 |
Bloom S. L., Esik Z. |
|
|
|
Lecture Notes in Computer Science |
16.06.1995 |
|
СТ |
Free Shuffle Algebras in Language Varieties |
1995 |
Bloom S. L., Esik Z. |
|
|
|
Lecture Notes in Computer Science |
13.04.1995 |
|
СТ |
Solving Polynomial Fixed Point Equations |
1994 |
Bloom S. L., Esik Z. |
|
|
|
Lecture Notes in Computer Science |
29.09.1994 |
