![]() | ![]() |
2004 | ||
---|---|---|
8 | EE | Friedrich Otto, Olga Sokratova: Reduction relations for monoid semirings. J. Symb. Comput. 37(3): 343-376 (2004) |
2003 | ||
7 | EE | Andrei Kelarev, Olga Sokratova: On congruences of automata defined by directed graphs. Theor. Comput. Sci. 1-3(301): 31-43 (2003) |
2002 | ||
6 | EE | Andrei Kelarev, Olga Sokratova: Two Algorithms for Languages Recognized by Graph Algebras. Int. J. Comput. Math. 79(12): 1317-1327 (2002) |
2001 | ||
5 | EE | Andrei Kelarev, Olga Sokratova: Information Rates and Weights of Codes in Structural Matrix Rings. AAECC 2001: 151-158 |
4 | EE | Olga Sokratova: Linear Automata and Recognizable Subsets in Free Semirings. FCT 2001: 420-423 |
3 | EE | Andrei Kelarev, Olga Sokratova: Languages Recognized by a Class of Finite Automata. Acta Cybern. 15(1): 45-52 (2001) |
2 | Andrei Kelarev, Olga Sokratova: Directed Graphs and Syntactic Algebras of Tree Languages. Journal of Automata, Languages and Combinatorics 6(3): 305-311 (2001) | |
1 | EE | Olga Sokratova: The Mal'cev Lemma and rewriting on semirings. Theor. Comput. Sci. 255(1-2): 611-614 (2001) |
1 | Andrei Kelarev | [2] [3] [5] [6] [7] |
2 | Friedrich Otto | [8] |