Emanuela Fachini

J. Comb. Theory A, 2020

2019

Interlocked Permutations.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

2017

Hamilton Paths With Lasting Separation.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Path Separation by Short Cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

2016

Zero-Error Capacity of Binary Channels With Memory.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

2014

Connector Families of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2014

2013

More on Connector Families.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

2011

Skewincidence.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Forbiddance and Capacity.

[BibT_eX]

[DOI]

Graphs Comb., 2011

Permutation Capacities and Oriented Infinite Paths.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

2010

Permutation Capacities of Families of Oriented Infinite Paths.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

2008

On the permutation capacity of digraphs

[BibT_eX]

[DOI]

CoRR, 2008

2007

Cross-intersecting couples of graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

2003

Codes for a long silence.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

2001

A Better Bound for Locally Thin Set Families.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2001

Recursive bounds for perfect hashing.

[BibT_eX]

[DOI]

Alon Nilli

Discret. Appl. Math., 2001

Self-Similarity Bounds for Locally Thin Set Families.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2001

A Note On Counting Very Different Sequences.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2001

2000

Colour Number, Capacity, and Perfectness of Directed Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2000

Locally Thin Set Families.

[BibT_eX]

[DOI]

Noga Alon

Comb. Probab. Comput., 2000

1997

Chomsky Hierarchy and Systolic Y-Tree Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1997

1996

Tight Packings of Hamming Spheres.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1996

1995

Power of Interconnections and of Nondeterminism in Regular Y-Tree Systolic Automata.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1995

1994

A Kleene-like Characterization of Languages Accepted by Systolic Tree Automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1994

1992

Classes of Systolic Y-Tree Automata and a Comparison with Systolic Trellis Automata.

[BibT_eX]

[DOI]

Acta Informatica, 1992

Languages Accepted by Systolic Y-Tree Automata: Structural Characterizations.

[BibT_eX]

[DOI]

Acta Informatica, 1992

1991

Nonacceptability Criteria and Closure Properties for the Class of Languages Accepted by Binary Systolic Tree Automata.

[BibT_eX]

[DOI]

Giovanni Resta

Theor. Comput. Sci., 1991

Systolic Y-Tree Automata: Closure Properties and Decision Problems.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990

Simulation of Systolic Tree Automata on Trellis Automata.

[BibT_eX]

[DOI]

Jozef Gruska

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

Cellular Automata with Regular Behavior.

[BibT_eX]

[DOI]

L. Vassallo

Complex Syst., 1990

Comparisons Among Classes of Y-Tree Systolic Automata.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

1988

C-Tree Systolic Automata.

[BibT_eX]

[DOI]

Margherita Napoli

Theor. Comput. Sci., 1988

1986

A note on the paper "Systolic tree acceptors" by K. Culik II, A. Salomaa and D. Wood.

[BibT_eX]

Lorenzo Iania

Bull. EATCS, 1986

1985

Synchronized Bottom-Up Tree Automata and L-Systems.

[BibT_eX]

[DOI]

Margherita Napoli

Proceedings of the Mathematical Foundations of Software Development, 1985

1984

Hierarchies of Primitive Recursive Wordsequence Functions: Comparisons and Decision Problems.

[BibT_eX]

[DOI]

Margherita Napoli

Theor. Comput. Sci., 1984

1982

Comparing Hierarchies of Primitive Recursive Sequence Functions.

[BibT_eX]

[DOI]