Comparing Hierarchies of Primitive Recursive Sequence Functions. - Emanuela Fachini; Andrea Maggiolo-Schettini (Math. Log. Q., 1982)

Hierarchies of Primitive Recursive Wordsequence Functions: Comparisons and Decision Problems. - Emanuela Fachini; Margherita Napoli (Theor. Comput. Sci., 1984)

Synchronized Bottom-Up Tree Automata and L-Systems. - Emanuela Fachini; Margherita Napoli (TAPSOFT, Vol.1, 1985)

A note on the paper "Systolic tree acceptors" by K. Culik II, A. Salomaa and D. Wood. - Emanuela Fachini; Lorenzo Iania (Bull. EATCS, 1986)

C-Tree Systolic Automata. - Emanuela Fachini; Margherita Napoli (Theor. Comput. Sci., 1988)

Comparisons Among Classes of Y-Tree Systolic Automata. - Emanuela Fachini; Andrea Maggiolo-Schettini; Davide Sangiorgi (MFCS, 1990)

Cellular Automata with Regular Behavior. - Emanuela Fachini; L. Vassallo (Complex Syst., 1990)

Simulation of Systolic Tree Automata on Trellis Automata. - Emanuela Fachini; Jozef Gruska; Andrea Maggiolo-Schettini; Davide Sangiorgi (Int. J. Found. Comput. Sci., 1990)

Systolic Y-Tree Automata: Closure Properties and Decision Problems. - Emanuela Fachini; Angelo Monti; Margherita Napoli; Domenico Parente (FCT, 1991)

Nonacceptability Criteria and Closure Properties for the Class of Languages Accepted by Binary Systolic Tree Automata. - Emanuela Fachini; Andrea Maggiolo-Schettini; Giovanni Resta; Davide Sangiorgi (Theor. Comput. Sci., 1991)

Languages Accepted by Systolic Y-Tree Automata: Structural Characterizations. - Emanuela Fachini; Angelo Monti; Margherita Napoli; Domenico Parente (Acta Informatica, 1992)

Classes of Systolic Y-Tree Automata and a Comparison with Systolic Trellis Automata. - Emanuela Fachini; Andrea Maggiolo-Schettini; Davide Sangiorgi (Acta Informatica, 1992)

A Kleene-like Characterization of Languages Accepted by Systolic Tree Automata. - Emanuela Fachini; Angelo Monti (J. Comput. Syst. Sci., 1994)

Power of Interconnections and of Nondeterminism in Regular Y-Tree Systolic Automata. - Emanuela Fachini; Jozef Gruska; Margherita Napoli; Domenico Parente (Math. Syst. Theory, 1995)

Tight Packings of Hamming Spheres. - Emanuela Fachini; János Körner (J. Comb. Theory A, 1996)

Chomsky Hierarchy and Systolic Y-Tree Automata. - Emanuela Fachini; Angelo Monti (Fundam. Informaticae, 1997)

Locally Thin Set Families. - Noga Alon; Emanuela Fachini; János Körner (Comb. Probab. Comput., 2000)

Colour Number, Capacity, and Perfectness of Directed Graphs. - Emanuela Fachini; János Körner (Graphs Comb., 2000)

A Note On Counting Very Different Sequences. - Emanuela Fachini; János Körner (Comb. Probab. Comput., 2001)

Self-Similarity Bounds for Locally Thin Set Families. - Emanuela Fachini; János Körner; Angelo Monti (Comb. Probab. Comput., 2001)

Recursive bounds for perfect hashing. - Emanuela Fachini; Alon Nilli (Discret. Appl. Math., 2001)

A Better Bound for Locally Thin Set Families. - Emanuela Fachini; János Körner; Angelo Monti (J. Comb. Theory A, 2001)

Codes for a long silence. - Emanuela Fachini; János Körner (IEEE Trans. Inf. Theory, 2003)

Cross-intersecting couples of graphs. - Emanuela Fachini; János Körner (J. Graph Theory, 2007)

On the permutation capacity of digraphs - Gérard D. Cohen; Emanuela Fachini; János Körner (CoRR, 2008)

Permutation Capacities of Families of Oriented Infinite Paths. - Graham R. Brightwell; Gérard D. Cohen; Emanuela Fachini; Marianne Fairthorne; János Körner; Gábor Simonyi; Ágnes Tóth (SIAM J. Discret. Math., 2010)

Permutation Capacities and Oriented Infinite Paths. - Graham R. Brightwell; Gérard D. Cohen; Emanuela Fachini; Marianne Fairthorne; János Körner; Gábor Simonyi; Ágnes Tóth (Electron. Notes Discret. Math., 2011)

Forbiddance and Capacity. - Emanuela Fachini; János Körner (Graphs Comb., 2011)

Skewincidence. - Gérard D. Cohen; Emanuela Fachini; János Körner (IEEE Trans. Inf. Theory, 2011)

More on Connector Families. - Gérard D. Cohen; Emanuela Fachini; János Körner (Electron. Notes Discret. Math., 2013)

Connector Families of Graphs. - Gérard D. Cohen; Emanuela Fachini; János Körner (Graphs Comb., 2014)

Zero-Error Capacity of Binary Channels With Memory. - Gérard D. Cohen; Emanuela Fachini; János Körner (IEEE Trans. Inf. Theory, 2016)

Path Separation by Short Cycles. - Gérard D. Cohen; Emanuela Fachini; János Körner (J. Graph Theory, 2017)

Hamilton Paths With Lasting Separation. - Emanuela Fachini; János Körner (IEEE Trans. Inf. Theory, 2017)

Interlocked Permutations. - Gérard D. Cohen; Emanuela Fachini; János Körner (SIAM J. Discret. Math., 2019)

Divergent permutations. - Emanuela Fachini; János Körner (J. Comb. Theory A, 2020)