| 1997 |
|---|
| 28 | EE | Stephen D. Brookes,
Michael G. Main,
Austin Melton,
Michael W. Mislove:
Foreword.
Electr. Notes Theor. Comput. Sci. 6: (1997) |
| 1995 |
|---|
| 27 | EE | Stephen D. Brookes,
Michael G. Main,
Austin Melton,
Michael W. Mislove:
Foreword and Dedication.
Electr. Notes Theor. Comput. Sci. 1: (1995) |
| 1994 |
|---|
| 26 | | Stephen D. Brookes,
Michael G. Main,
Austin Melton,
Michael W. Mislove,
David A. Schmidt:
Mathematical Foundations of Programming Semantics, 9th International Conference, New Orleans, LA, USA, April 7-10, 1993, Proceedings
Springer 1994 |
| 1993 |
|---|
| 25 | | Michael G. Main,
David L. Black:
Semantic Models for Total Correctness and Fairness.
Theor. Comput. Sci. 107(2): 305-332 (1993) |
| 24 | | Michael G. Main:
Complete Proof Rules for Strong Fairness and Strong Extreme Fairness.
Theor. Comput. Sci. 111(1&2): 125-143 (1993) |
| 1992 |
|---|
| 23 | | Stephen D. Brookes,
Michael G. Main,
Austin Melton,
Michael W. Mislove,
David A. Schmidt:
Mathematical Foundations of Programming Semantics, 7th International Conference, Pittsburgh, PA, USA, March 25-28, 1991, Proceedings
Springer 1992 |
| 22 | | A. Gayler Harford,
Vincent P. Heuring,
Michael G. Main:
A New Parsing Method for Non-LR(1) Grammars.
Softw., Pract. Exper. 22(5): 419-437 (1992) |
| 1990 |
|---|
| 21 | | Michael G. Main,
Austin Melton,
Michael W. Mislove,
David A. Schmidt:
Mathematical Foundations of Programming Semantics, 5th International Conference, Tulane University, New Orleans, Louisiana, USA, March 29 - April 1, 1989, Proceedings
Springer 1990 |
| 20 | | Michael G. Main,
Grzegorz Rozenberg:
Edge-Label Controlled Graph Grammars.
J. Comput. Syst. Sci. 40(2): 188-228 (1990) |
| 19 | | Jochen Hoffmann,
Michael G. Main:
Results on NLC Grammars with One-Letter Terminal Alphabets.
Theor. Comput. Sci. 73(3): 279-294 (1990) |
| 1989 |
|---|
| 18 | | Michael G. Main,
David L. Black:
Semantic Models for Total Correctness and Fairness.
Mathematical Foundations of Programming Semantics 1989: 247-270 |
| 17 | EE | Michael G. Main:
Detecting leftmost maximal periodicities.
Discrete Applied Mathematics 25(1-2): 145-153 (1989) |
| 1988 |
|---|
| 16 | | Michael G. Main,
Austin Melton,
Michael W. Mislove,
David A. Schmidt:
Mathematical Foundations of Programming Language Semantics, 3rd Workshop, Tulane University, New Orleans, Louisiana, USA, April 8-10, 1987, Proceedings
Springer 1988 |
| 1987 |
|---|
| 15 | | Michael G. Main,
Grzegorz Rozenberg:
Handle NLC Grammars and R.E. Languages.
J. Comput. Syst. Sci. 35(2): 192-205 (1987) |
| 14 | | David B. Benson,
Michael G. Main:
Workshop Report: Third Workshop on the Mathematical Foundations of Programming Language Semantics, 1987, New Orleans.
SIGPLAN Notices 22(9): 38-43 (1987) |
| 13 | | Michael G. Main,
Walter Bucher,
David Haussler:
Applications of an Infinite Square-Free CO-CFL.
Theor. Comput. Sci. 49: 113-119 (1987) |
| 1986 |
|---|
| 12 | | Michael G. Main,
Grzegorz Rozenberg:
Fundamentals of edge-label controlled graph grammars.
Graph-Grammars and Their Application to Computer Science 1986: 411-426 |
| 1985 |
|---|
| 11 | | Michael G. Main,
Walter Bucher,
David Haussler:
Applications of an Infinite Squarefree CO-CFL.
ICALP 1985: 404-412 |
| 10 | | Michael G. Main:
Free Constructions of Powerdomains.
Mathematical Foundations of Programming Semantics 1985: 162-183 |
| 9 | | Michael G. Main:
An Infinite Square-Free co-CFL.
Inf. Process. Lett. 20(2): 105-107 (1985) |
| 8 | | Michael G. Main,
David B. Benson:
Free Semiring-Representations and Nondeterminism.
J. Comput. Syst. Sci. 30(3): 318-328 (1985) |
| 1984 |
|---|
| 7 | | Michael G. Main,
David B. Benson:
Functional Behvior of Nondeterministic and Concurrent Programs
Information and Control 62(2/3): 144-189 (1984) |
| 6 | | Michael G. Main,
Richard J. Lorentz:
An O(n log n) Algorithm for Finding All Repetitions in a String.
J. Algorithms 5(3): 422-432 (1984) |
| 5 | | Andrzej Ehrenfeucht,
Michael G. Main,
Grzegorz Rozenberg:
Restrictions on NLC Graph Grammars.
Theor. Comput. Sci. 31: 211-223 (1984) |
| 1983 |
|---|
| 4 | | Michael G. Main,
David B. Benson:
Functional Behaviour of Nondeterministic Programs.
FCT 1983: 290-301 |
| 3 | | Michael G. Main,
David B. Benson:
Denotational Semantics for ``Natural'' Language Question-Answering Programs.
American Journal of Computational Linguistics 9(1): 11-21 (1983) |
| 1982 |
|---|
| 2 | | Michael G. Main:
Permutations Are Not Context-Free: An Application of the Interchange Lemma.
Inf. Process. Lett. 15(2): 68-71 (1982) |
| 1981 |
|---|
| 1 | | Michael G. Main,
David B. Benson:
Free Upper Regular Bands.
Theor. Comput. Sci. 16: 93-98 (1981) |
