Michael A. Harrison

From MaRDI portal
Person:1136237

Available identifiers

zbMath Open harrison.michael-aDBLPh/MichaelAHarrisonWikidataQ16729674 ScholiaQ16729674MaRDI QIDQ1136237

List of research outcomes





PublicationDate of PublicationType
Outer billiards in the spaces of oriented geodesics of the three-dimensional space forms2024-06-24Paper
SIC-POVMs from Stark units: Prime dimensions n^2+32021-12-10Paper
https://portal.mardi4nfdi.de/entity/Q40353421993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q37836081986-01-01Paper
Eliminating null rules in linear time1981-01-01Paper
An Improved Context-Free Recognizer1980-01-01Paper
On equivalence of grammars through transformation trees1979-01-01Paper
A hierarchy of deterministic languages1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41980751978-01-01Paper
On LR(k) grammars and languages1977-01-01Paper
Characteristic parsing: A framework for producing compact deterministic parsers. II1977-01-01Paper
Normal forms of deterministic grammars1977-01-01Paper
Characteristic parsing: A framework for producing compact deterministic parsers. I1977-01-01Paper
Protection in operating systems1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41442161976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41052441975-01-01Paper
On the Parsing of Deterministic Languages1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40697991974-01-01Paper
Mutually divisible semigroups1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41409131974-01-01Paper
Strict deterministic grammars1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56797201973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40944271973-01-01Paper
On the Number of Classes of Binary Matrices1973-01-01Paper
Canonical Precedence Schemes1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47660631973-01-01Paper
On the Covering and Reduction Problems for Context-Free Grammars1972-01-01Paper
Real-Time Strict Deterministic Languages1972-01-01Paper
A Grammatical Characterization of One-Way Nondeterministic Stack Languages1971-01-01Paper
On the closure of AFL under reversal1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55886911970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56139641969-01-01Paper
Decomposition of linear sequential machines1969-01-01Paper
On the cycle index of a product of permutation groups1968-01-01Paper
Multi-tape and multi-head pushdown automata1968-01-01Paper
One-way nondeterministic real-time list-storage languages1968-01-01Paper
Infinite linear sequential machines1968-01-01Paper
On the elimination of endmarkers1968-01-01Paper
On Equivalence of State Assignments1968-01-01Paper
Two-way pushdown automata1967-01-01Paper
Bracketed context-free languages1967-01-01Paper
Stack automata and compiling1967-01-01Paper
One-way stack automata1967-01-01Paper
A Numerical Procedure for Determination of the Prime Implicants of a Boolean Function1967-01-01Paper
The Number of Isomorphism Types of Finite Algebras1966-01-01Paper
The theory of sequential relations1966-01-01Paper
On Asymptotic Estimates in Switching and Automata Theory1966-01-01Paper
Note on the number of finite algebras1966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55936431965-01-01Paper
A Census of Finite Automata1965-01-01Paper
On the error correcting capacity of finite automata1965-01-01Paper
On the Classification of Boolean Functions by the General Linear and Affine Groups1964-01-01Paper
The Number of Transitivity Sets of Boolean Functions1963-01-01Paper
Algebraic Properties of Symmetric and Partially Symmetric Boolean Functions1963-01-01Paper
The Number of Classes of Invertible Boolean Functions1963-01-01Paper
Detection of Total or Partial Symmetry of a Switching Function with the Use of Decomposition Charts1963-01-01Paper
On the number of classes of (n,k) switching networks1963-01-01Paper

Research outcomes over time

This page was built for person: Michael A. Harrison