Ahmed Saoudi

Int. J. Wavelets Multiresolution Inf. Process., 2022

1995

Quadtree Algorithms for Template Matching on Mesh Connected Computer.

[BibT_eX]

[DOI]

Houcine Senoussi

Int. J. Pattern Recognit. Artif. Intell., 1995

1994

A Quadtree Algorithm for Template Matching on a Pyramid Computer.

[BibT_eX]

[DOI]

Houcine Senoussi

Theor. Comput. Sci., 1994

Efficient Parallel Shuffle Recognition.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1994

Parallel Algorithms for Multi-Dimensional Image Template Matching.

[BibT_eX]

[DOI]

Int. J. Pattern Recognit. Artif. Intell., 1994

Context-Sensitivity of Puzzle Grammars.

[BibT_eX]

[DOI]

P. Laroche

Int. J. Pattern Recognit. Artif. Intell., 1994

1993

Learning local and recognizable Ω-languages and monadic logic programs.

[BibT_eX]

Takashi Yokomori

Proceedings of the First European Conference on Computational Learning Theory, 1993

1992

Alternating Automata, the Weak Monadic Theory of Trees and its Complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

Basic Puzzle Grammars and Isosceles Right Triangles.

[BibT_eX]

[DOI]

Int. J. Pattern Recognit. Artif. Intell., 1992

On Parallel Recognition of Two Classes of 2-D Array Patterns.

[BibT_eX]

[DOI]

Wojciech Rytter

Int. J. Pattern Recognit. Artif. Intell., 1992

Parallel Recognition of High Dimensional Images.

[BibT_eX]

[DOI]

Int. J. Pattern Recognit. Artif. Intell., 1992

Finite State Processes, Z-Temporal Logic and the Monadic Theory of the Integers.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1992

Pushdown Automata on Infinite Trees and Nondeterministic Context-Free Programs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1992

A Parallel Algorithm for Recognizing the Shuffle of Two Strings.

[BibT_eX]

[DOI]

Proceedings of the 6th International Parallel Processing Symposium, 1992

Parallel algorithms for 2D-image recognition.

[BibT_eX]

[DOI]

Wojciech Rytter

Proceedings of the 11th IAPR International Conference on Pattern Recognition, 1992

Optimal Parallel Algorithms for Multidimensional Image Template Matching and Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the Parallel Image Analysis, Second International Conference, 1992

Parallel Recognition of Multidimensional Images Using Regular Tree Grammars.

[BibT_eX]

[DOI]

Proceedings of the Parallel Image Analysis, Second International Conference, 1992

On the Decidability of the Linear Z-Temporal Logic and the Monadic Second Order Theory.

[BibT_eX]

Proceedings of the Computing and Information, 1992

Automata on infinite trees and rational control.

[BibT_eX]

Paola Bonizzoni

Proceedings of the Tree Automata and Languages., 1992

Rational and recognizable infinite tree sets.

[BibT_eX]

Proceedings of the Tree Automata and Languages., 1992

1991

Generalized Automata on Infinite Trees and Muller-McNaughton's Theorem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

On the Complexity of the Recognition of Parallel 2D-Image Languages.

[BibT_eX]

[DOI]

Wojciech Rytter

Inf. Process. Lett., 1991

Puzzle Grammars and Context-Free Array Grammars.

[BibT_eX]

[DOI]

Int. J. Pattern Recognit. Artif. Intell., 1991

Parallel Recognition of Two-Dimensional Images.

[BibT_eX]

Proceedings of the International Conference on Parallel Processing, 1991

1990

On the Complexity of omega-Tree Sets and Nerode Theorem.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1990

Parallel generation of infinite images.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1990

1989

Automata on Infinite Objects and Their Applications to Logic and Programming

[BibT_eX]

[DOI]

Inf. Comput., October, 1989

Finite Images Generated by GL-Systems.

[BibT_eX]

[DOI]

K. Rangarajan

Proceedings of the Array Grammars, Patterns and Recognizers, 1989

Parallel Generation of Finite Images.

[BibT_eX]

[DOI]

Proceedings of the Array Grammars, Patterns and Recognizers, 1989

Finite Images Generated by GL-Systems.

[BibT_eX]

[DOI]

K. Rangarajan

Int. J. Pattern Recognit. Artif. Intell., 1989

Parallel Generation of Finite Images.

[BibT_eX]

[DOI]

Int. J. Pattern Recognit. Artif. Intell., 1989

Pushdown Automata on Infinite Trees and Omega-Kleene closure of Context-Free Tree Sets.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

1988

Automata on infinite trees and Kleene closure of regular tree sets.

[BibT_eX]

Bull. EATCS, 1988

Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential Time

[BibT_eX]

[DOI]

Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

1986

Variétés d'Automates Descendants d'Arbres Infinis.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1984

Infinitary Tree Languages Recognized by omega-Automata.

[BibT_eX]

[DOI]