Igor Litovsky

According to our database1, Igor Litovsky authored at least 26 papers between 1987 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
One-relation languages and code generators.
RAIRO Theor. Informatics Appl., 2021

2006
Editorial.
Theor. Comput. Sci., 2006

2002
On a Family of Codes with Bounded Deciphering Delay.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

1997
Finite Acceptance of Infinite Words.
Theor. Comput. Sci., 1997

On a Binary Zigzag Operation.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

1996
A More Efficient Notion of Zigzag Stability.
RAIRO Theor. Informatics Appl., 1996

On Codes, omega-Codes and omega-Generators.
Inf. Process. Lett., 1996

1995
On the Recognition of Families of Graphs with Local Computations
Inf. Comput., April, 1995

Characterizations of Rational omega-Languages by Means of Right Congruences.
Theor. Comput. Sci., 1995

Different Local Controls for Graph Relabeling Systems.
Math. Syst. Theory, 1995

Checking global graph properties by means of local computations: the majority problem.
Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation, 1995

1994
Codes and Infinite Words.
Acta Cybern., 1994

On the Minimization Prolem for Omega-Automata.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

1993
Stability for the Zigzag Submonoids.
Theor. Comput. Sci., 1993

Computing with Graph Rewriting Systems with Priorities.
Theor. Comput. Sci., 1993

1992
On coding morphisms for zigzag codes.
RAIRO Theor. Informatics Appl., 1992

Rebootable and suffix-closed omega-power languages.
RAIRO Theor. Informatics Appl., 1992

The Power and the Limitations of Local Computations on Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1992

Definitions and Comparisons of Local Computations on Graphs.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

Computing trees with graph rewriting systems with priorities.
Proceedings of the Tree Automata and Languages., 1992

1991
Finitely Generated bi-omega-Languages.
Theor. Comput. Sci., 1991

Prefix-Free Languages as omega-Generators.
Inf. Process. Lett., 1991

Free Submonoids and Minimal ω-Generators of R<sup>ω</sup>.
Acta Cybern., 1991

1990
Computing with Graph Relabelling Systems with Priorities.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1990

1989
Rank of Rational Finitely Generated W-Languages.
Proceedings of the Fundamentals of Computation Theory, 1989

1987
On Generators of Rational omega-Power Languages.
Theor. Comput. Sci., 1987


  Loading...