Free Upper Regular Bands. - Michael G. Main; David B. Benson (Theor. Comput. Sci., 1981)

Permutations Are Not Context-Free: An Application of the Interchange Lemma. - Michael G. Main (Inf. Process. Lett., 1982)

Functional Behaviour of Nondeterministic Programs. - Michael G. Main; David B. Benson (FCT, 1983)

Denotational Semantics for "Natural" Language Question-Answering Programs. - Michael G. Main; David B. Benson (Am. J. Comput. Linguistics, 1983)

Functional Behvior of Nondeterministic and Concurrent Programs - Michael G. Main; David B. Benson (Inf. Control., 1984)

An O(n log n) Algorithm for Finding All Repetitions in a String. - Michael G. Main; Richard J. Lorentz (J. Algorithms, 1984)

Restrictions on NLC Graph Grammars. - Andrzej Ehrenfeucht; Michael G. Main; Grzegorz Rozenberg (Theor. Comput. Sci., 1984)

Applications of an Infinite Squarefree CO-CFL. - Michael G. Main; Walter Bucher; David Haussler (ICALP, 1985)

Free Constructions of Powerdomains. - Michael G. Main (Mathematical Foundations of Programming Semantics, 1985)

An Infinite Square-Free co-CFL. - Michael G. Main (Inf. Process. Lett., 1985)

Free Semiring-Representations and Nondeterminism. - Michael G. Main; David B. Benson (J. Comput. Syst. Sci., 1985)

Fundamentals of edge-label controlled graph grammars. - Michael G. Main; Grzegorz Rozenberg (Graph-Grammars and Their Application to Computer Science, 1986)

Trace, failure and testing equivalences for communicating processes. - Michael G. Main (Int. J. Parallel Program., 1987)

Handle NLC Grammars and R.E. Languages. - Michael G. Main; Grzegorz Rozenberg (J. Comput. Syst. Sci., 1987)

Workshop Report: Third Workshop on the Mathematical Foundations of Programming Language Semantics, 1987, New Orleans. - David B. Benson; Michael G. Main (ACM SIGPLAN Notices, 1987)

Applications of an Infinite Square-Free CO-CFL. - Michael G. Main; Walter Bucher; David Haussler (Theor. Comput. Sci., 1987)

Detecting leftmost maximal periodicities. - Michael G. Main (Discret. Appl. Math., 1989)

Edge-Label Controlled Graph Grammars. - Michael G. Main; Grzegorz Rozenberg (J. Comput. Syst. Sci., 1990)

Results on NLC Grammars with One-Letter Terminal Alphabets. - Jochen Hoffmann; Michael G. Main (Theor. Comput. Sci., 1990)

A New Parsing Method for Non-LR(1) Grammars. - A. Gayler Harford; Vincent P. Heuring; Michael G. Main (Softw. Pract. Exp., 1992)

Complete Proof Rules for Strong Fairness and Strong Extreme Fairness. - Michael G. Main (Theor. Comput. Sci., 1993)

Semantic Models for Total Correctness and Fairness. - Michael G. Main; David L. Black 002 (Theor. Comput. Sci., 1993)

Foreword and Dedication. - Stephen D. Brookes; Michael G. Main; Austin Melton; Michael W. Mislove (MFPS, 1995)

Foreword. - Stephen D. Brookes; Michael G. Main; Austin Melton; Michael W. Mislove (MFPS, 1997)

Combinatorics of Life and Death for Reaction Systems. - Andrzej Ehrenfeucht; Michael G. Main; Grzegorz Rozenberg (Int. J. Found. Comput. Sci., 2010)

A Tour of reaction Systems. - Robert Brijder; Andrzej Ehrenfeucht; Michael G. Main; Grzegorz Rozenberg (Int. J. Found. Comput. Sci., 2011)

Functions Defined by Reaction Systems. - Andrzej Ehrenfeucht; Michael G. Main; Grzegorz Rozenberg (Int. J. Found. Comput. Sci., 2011)

Stability and Chaos in reaction Systems. - Andrzej Ehrenfeucht; Michael G. Main; Grzegorz Rozenberg; Allison Thompson Brown (Int. J. Found. Comput. Sci., 2012)