Michael G. Main - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2012

Stability and Chaos in reaction SystemsAndrzej Ehrenfeucht, Michael G. Main, Grzegorz Rozenberg, Allison Thompson Brown. ijfcs, 23(5):1173, 2012. [doi]

2011

A Tour of reaction SystemsRobert Brijder, Andrzej Ehrenfeucht, Michael G. Main, Grzegorz Rozenberg. ijfcs, 22(7):1499-1517, 2011. [doi]

Functions Defined by Reaction SystemsAndrzej Ehrenfeucht, Michael G. Main, Grzegorz Rozenberg. ijfcs, 22(1):167-178, 2011. [doi]

2010

Combinatorics of Life and Death for Reaction SystemsAndrzej Ehrenfeucht, Michael G. Main, Grzegorz Rozenberg. ijfcs, 21(3):345-356, 2010. [doi]

1997

ForewordStephen D. Brookes, Michael G. Main, Austin Melton, Michael W. Mislove. ENTCS, 6:1-2, 1997. [doi]

1995

Foreword and DedicationStephen D. Brookes, Michael G. Main, Austin Melton, Michael W. Mislove. ENTCS, 1:557-558, 1995. [doi]

1993

Semantic Models for Total Correctness and FairnessMichael G. Main, David L. Black. TCS, 107(2):305-332, 1993.

Complete Proof Rules for Strong Fairness and Strong Extreme FairnessMichael G. Main. TCS, 111(1&2):125-143, 1993.

1992

A New Parsing Method for Non-LR(1) GrammarsA. Gayler Harford, Vincent P. Heuring, Michael G. Main. SPE, 22(5):419-437, 1992.

1990

Results on NLC Grammars with One-Letter Terminal AlphabetsJochen Hoffmann, Michael G. Main. TCS, 73(3):279-294, 1990.

Edge-Label Controlled Graph GrammarsMichael G. Main, Grzegorz Rozenberg. jcss, 40(2):188-228, 1990.

1989

Detecting leftmost maximal periodicitiesMichael G. Main. DAM, 25(1-2):145-153, 1989. [doi]

Semantic Models for Total Correctness and FairnessMichael G. Main, David L. Black. mfps 1990: 247-270

1987

Workshop Report: Third Workshop on the Mathematical Foundations of Programming Language Semantics, 1987, New OrleansDavid B. Benson, Michael G. Main. SIGPLAN, 22(9):38-43, 1987.

Applications of an Infinite Square-Free CO-CFLMichael G. Main, Walter Bucher, David Haussler. TCS, 49:113-119, 1987.

Handle NLC Grammars and R.E. LanguagesMichael G. Main, Grzegorz Rozenberg. jcss, 35(2):192-205, 1987.

Trace, failure and testing equivalences for communicating processesMichael G. Main. ijpp, 16(5):383-400, 1987. [doi]

1986

Fundamentals of edge-label controlled graph grammarsMichael G. Main, Grzegorz Rozenberg. gg 1987: 411-426

1985

Free Constructions of PowerdomainsMichael G. Main. mfps 1986: 162-183

Applications of an Infinite Squarefree CO-CFLMichael G. Main, Walter Bucher, David Haussler. icalp 1985: 404-412

An Infinite Square-Free co-CFLMichael G. Main. ipl, 20(2):105-107, 1985.

Free Semiring-Representations and NondeterminismMichael G. Main, David B. Benson. jcss, 30(3):318-328, 1985.

1984

Restrictions on NLC Graph GrammarsAndrzej Ehrenfeucht, Michael G. Main, Grzegorz Rozenberg. TCS, 31:211-223, 1984.

Functional Behvior of Nondeterministic and Concurrent ProgramsMichael G. Main, David B. Benson. iandc, 62(2/3):144-189, August/September 1984.

An O(n log n) Algorithm for Finding All Repetitions in a StringMichael G. Main, Richard J. Lorentz. jal, 5(3):422-432, 1984.

1983

Functional Behaviour of Nondeterministic ProgramsMichael G. Main, David B. Benson. fct 1983: 290-301

Denotational Semantics for Natural Language Question-Answering ProgramsMichael G. Main, David B. Benson. coling, 9(1):11-21, 1983.

1982

Permutations Are Not Context-Free: An Application of the Interchange LemmaMichael G. Main. ipl, 15(2):68-71, 1982.

1981

Free Upper Regular BandsMichael G. Main, David B. Benson. TCS, 16:93-98, 1981.

Sign in or sign up to see more results.

runs on WebDSL