Michael A. Harrison

Available identifiers

zbMath Open harrison.michael-aWikidataQ16729674 ScholiaQ16729674MaRDI QIDQ1136237

List of research outcomes

Publication	Date of Publication	Type
SIC-POVMs from Stark units: Prime dimensions n^2+3	2021-12-10	Paper
https://portal.mardi4nfdi.de/entity/Q4035342	1993-05-18	Paper
https://portal.mardi4nfdi.de/entity/Q3783608	1986-01-01	Paper
Eliminating null rules in linear time	1981-01-01	Paper
An Improved Context-Free Recognizer	1980-01-01	Paper
A hierarchy of deterministic languages	1979-01-01	Paper
On equivalence of grammars through transformation trees	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4198075	1978-01-01	Paper
Normal forms of deterministic grammars	1977-01-01	Paper
On LR(k) grammars and languages	1977-01-01	Paper
Characteristic parsing: A framework for producing compact deterministic parsers. I	1977-01-01	Paper
Characteristic parsing: A framework for producing compact deterministic parsers. II	1977-01-01	Paper
Protection in operating systems	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4144216	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4105244	1975-01-01	Paper
Mutually divisible semigroups	1974-01-01	Paper
On the Parsing of Deterministic Languages	1974-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4069799	1974-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4140913	1974-01-01	Paper
Strict deterministic grammars	1973-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4094427	1973-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4766063	1973-01-01	Paper
On the Number of Classes of Binary Matrices	1973-01-01	Paper
Canonical Precedence Schemes	1973-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5679720	1973-01-01	Paper
On the Covering and Reduction Problems for Context-Free Grammars	1972-01-01	Paper
Real-Time Strict Deterministic Languages	1972-01-01	Paper
A Grammatical Characterization of One-Way Nondeterministic Stack Languages	1971-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5588691	1970-01-01	Paper
On the closure of AFL under reversal	1970-01-01	Paper
Decomposition of linear sequential machines	1969-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5613964	1969-01-01	Paper
Infinite linear sequential machines	1968-01-01	Paper
On Equivalence of State Assignments	1968-01-01	Paper
Multi-tape and multi-head pushdown automata	1968-01-01	Paper
On the elimination of endmarkers	1968-01-01	Paper
One-way nondeterministic real-time list-storage languages	1968-01-01	Paper
On the cycle index of a product of permutation groups	1968-01-01	Paper
Bracketed context-free languages	1967-01-01	Paper
Stack automata and compiling	1967-01-01	Paper
Two-way pushdown automata	1967-01-01	Paper
One-way stack automata	1967-01-01	Paper
A Numerical Procedure for Determination of the Prime Implicants of a Boolean Function	1967-01-01	Paper
The Number of Isomorphism Types of Finite Algebras	1966-01-01	Paper
Note on the number of finite algebras	1966-01-01	Paper
The theory of sequential relations	1966-01-01	Paper
On Asymptotic Estimates in Switching and Automata Theory	1966-01-01	Paper
A Census of Finite Automata	1965-01-01	Paper
On the error correcting capacity of finite automata	1965-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5593643	1965-01-01	Paper
On the Classification of Boolean Functions by the General Linear and Affine Groups	1964-01-01	Paper
On the number of classes of (n,k) switching networks	1963-01-01	Paper
The Number of Classes of Invertible Boolean Functions	1963-01-01	Paper
Detection of Total or Partial Symmetry of a Switching Function with the Use of Decomposition Charts	1963-01-01	Paper
The Number of Transitivity Sets of Boolean Functions	1963-01-01	Paper
Algebraic Properties of Symmetric and Partially Symmetric Boolean Functions	1963-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Michael A. Harrison