Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Igor Litovsky
2000 – 2009
- 2006
[j17]- [e1]Jacques Farré, Igor Litovsky, Sylvain Schmitz (Eds.): Implementation and Application of Automata, 10th International Conference, CIAA 2005, Sophia Antipolis, France, June 27-29, 2005, Revised Selected Papers. Lecture Notes in Computer Science 3845, Springer 2006, ISBN 3-540-31023-1
- 2002
- [c8]Do Long Van, Igor Litovsky: On a Family of Codes with Bounded Deciphering Delay. Developments in Language Theory 2002: 369-380
1990 – 1999
- 1997
- [j16]Igor Litovsky, Ludwig Staiger: Finite Acceptance of Infinite Words. Theor. Comput. Sci. 174(1-2): 1-21 (1997)
- [c7]Igor Litovsky, Bruno Patrou: On a Binary Zigzag Operation. Developments in Language Theory 1997: 273-289
- 1996
- [j15]Sandrine Julia, Igor Litovsky, Bruno Patrou: On Codes, omega-Codes and omega-Generators. Inf. Process. Lett. 60(1): 1-5 (1996)
- [j14]Bertrand Le Saëc, Igor Litovsky, Bruno Patrou: A More Efficient Notion of Zigzag Stability. ITA 30(3): 181-194 (1996)
- 1995
- [j13]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: 199-206 (1995)
- [j12]Igor Litovsky, Yves Métivier, Wieslaw Zielonka: On the Recognition of Families of Graphs with Local Computations. Inf. Comput. 118(1): 110-119 (1995)
- [j11]Igor Litovsky, Yves Métivier, Eric Sopena: Different Local Controls for Graph Relabeling Systems. Mathematical Systems Theory 28(1): 41-65 (1995)
- [j10]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)
- [c6]Igor Litovsky, Ludwig Staiger: Finite Acceptance of Infinite Words. Developments in Language Theory 1995: 360-369
- 1994
- [j9]Jeanne Devolder, Michel Latteux, Igor Litovsky, Ludwig Staiger: Codes and Infinite Words. Acta Cybern. 11(4): 241-256 (1994)
- [c5]
- 1993
- [j8]Do Long Van, Bertrand Le Saëc, Igor Litovsky: Stability for the Zigzag Submonoids. Theor. Comput. Sci. 108(2): 237-249 (1993)
- [j7]Igor Litovsky, Yves Métivier: Computing with Graph Rewriting Systems with Priorities. Theor. Comput. Sci. 115(2): 191-224 (1993)
- 1992
- [j6]Bertrand Le Saëc, Igor Litovsky: Rebootable and suffix-closed omega-power languages. ITA 26: 45-58 (1992)
- [j5]Do Long Van, Bertrand Le Saëc, Igor Litovsky: On coding morphisms for zigzag codes. ITA 26: 565- (1992)
- [p1]Igor Litovsky, Yves Métivier: Computing trees with graph rewriting systems with priorities. Tree Automata and Languages 1992: 115-140
- [c4]Igor Litovsky, Yves Métivier, Eric Sopena: Definitions and Comparisons of Local Computations on Graphs. MFCS 1992: 364-373
- [c3]Igor Litovsky, Yves Métivier, Wieslaw Zielonka: The Power and the Limitations of Local Computations on Graphs. WG 1992: 333-345
- 1991
- [j4]Igor Litovsky: Free Submonoids and Minimal omega-Generators of Romega. Acta Cybern. 10(1-2): 35-44 (1991)
- [j3]
- [j2]Jeanne Devolder, Igor Litovsky: Finitely Generated bi-omega-Languages. Theor. Comput. Sci. 85(1): 33-52 (1991)
- 1990
- [c2]Igor Litovsky, Yves Métivier: Computing with Graph Relabelling Systems with Priorities. Graph-Grammars and Their Application to Computer Science 1990: 549-563
1980 – 1989
- 1989
- [c1]
- 1987
- [j1]Igor Litovsky, Erick Timmerman: On Generators of Rational omega-Power Languages. Theor. Comput. Sci. 53: 187-200 (1987)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-09-10 15:58 CEST by the dblp team