| 2006 |
|---|
| 27 | | Jacques Farré,
Igor Litovsky,
Sylvain Schmitz:
Implementation and Application of Automata, 10th International Conference, CIAA 2005, Sophia Antipolis, France, June 27-29, 2005, Revised Selected Papers
Springer 2006 |
| 26 | EE | Jacques Farré,
Igor Litovsky:
Editorial.
Theor. Comput. Sci. 363(2): 107 (2006) |
| 2002 |
|---|
| 25 | EE | Do Long Van,
Igor Litovsky:
On a Family of Codes with Bounded Deciphering Delay.
Developments in Language Theory 2002: 369-380 |
| 1997 |
|---|
| 24 | | Igor Litovsky,
Bruno Patrou:
On a Binary Zigzag Operation.
Developments in Language Theory 1997: 273-289 |
| 23 | EE | Igor Litovsky,
Ludwig Staiger:
Finite Acceptance of Infinite Words.
Theor. Comput. Sci. 174(1-2): 1-21 (1997) |
| 1996 |
|---|
| 22 | | Bertrand Le Saëc,
Igor Litovsky,
Bruno Patrou:
A More Efficient Notion of Zigzag Stability.
ITA 30(3): 181-194 (1996) |
| 21 | EE | Sandrine Julia,
Igor Litovsky,
Bruno Patrou:
On Codes, omega-Codes and omega-Generators.
Inf. Process. Lett. 60(1): 1-5 (1996) |
| 1995 |
|---|
| 20 | | Igor Litovsky,
Ludwig Staiger:
Finite Acceptance of Infinite Words.
Developments in Language Theory 1995: 360-369 |
| 19 | EE | Igor Litovsky,
Yves Métivier,
Eric Sopena:
Checking global graph properties by means of local computations: the majority problem.
Electr. Notes Theor. Comput. Sci. 2: (1995) |
| 18 | | Igor Litovsky,
Yves Métivier,
Wieslaw Zielonka:
On the Recognition of Families of Graphs with Local Computations
Inf. Comput. 118(1): 110-119 (1995) |
| 17 | | Igor Litovsky,
Yves Métivier,
Eric Sopena:
Different Local Controls for Graph Relabeling Systems.
Mathematical Systems Theory 28(1): 41-65 (1995) |
| 16 | EE | Do Long Van,
Bertrand Le Saëc,
Igor Litovsky:
Characterizations of Rational omega-Languages by Means of Right Congruences.
Theor. Comput. Sci. 143(1): 1-21 (1995) |
| 1994 |
|---|
| 15 | | Bertrand Le Saëc,
Igor Litovsky:
On the Minimization Prolem for Omega-Automata.
MFCS 1994: 504-514 |
| 14 | EE | Jeanne Devolder,
Michel Latteux,
Igor Litovsky,
Ludwig Staiger:
Codes and Infinite Words.
Acta Cybern. 11(4): 241-256 (1994) |
| 1993 |
|---|
| 13 | | Do Long Van,
Bertrand Le Saëc,
Igor Litovsky:
Stability for the Zigzag Submonoids.
Theor. Comput. Sci. 108(2): 237-249 (1993) |
| 12 | | Igor Litovsky,
Yves Métivier:
Computing with Graph Rewriting Systems with Priorities.
Theor. Comput. Sci. 115(2): 191-224 (1993) |
| 1992 |
|---|
| 11 | | Igor Litovsky,
Yves Métivier,
Eric Sopena:
Definitions and Comparisons of Local Computations on Graphs.
MFCS 1992: 364-373 |
| 10 | | Igor Litovsky,
Yves Métivier,
Wieslaw Zielonka:
The Power and the Limitations of Local Computations on Graphs.
WG 1992: 333-345 |
| 9 | | Igor Litovsky,
Yves Métivier:
Computing trees with graph rewriting systems with priorities.
Tree Automata and Languages 1992: 115-140 |
| 8 | | Bertrand Le Saëc,
Igor Litovsky:
Rebootable and suffix-closed omega-power languages.
ITA 26: 45-58 (1992) |
| 7 | | Do Long Van,
Bertrand Le Saëc,
Igor Litovsky:
On coding morphisms for zigzag codes.
ITA 26: 565- (1992) |
| 1991 |
|---|
| 6 | EE | Igor Litovsky:
Free Submonoids and Minimal omega-Generators of Romega.
Acta Cybern. 10(1-2): 35-44 (1991) |
| 5 | | Igor Litovsky:
Prefix-Free Languages as omega-Generators.
Inf. Process. Lett. 37(2): 61-65 (1991) |
| 4 | | Jeanne Devolder,
Igor Litovsky:
Finitely Generated bi-omega-Languages.
Theor. Comput. Sci. 85(1): 33-52 (1991) |
| 1990 |
|---|
| 3 | | Igor Litovsky,
Yves Métivier:
Computing with Graph Relabelling Systems with Priorities.
Graph-Grammars and Their Application to Computer Science 1990: 549-563 |
| 1989 |
|---|
| 2 | | Igor Litovsky:
Rank of Rational Finitely Generated W-Languages.
FCT 1989: 308-317 |
| 1987 |
|---|
| 1 | | Igor Litovsky,
Erick Timmerman:
On Generators of Rational omega-Power Languages.
Theor. Comput. Sci. 53: 187-200 (1987) |
