K. Vairavan

Available identifiers

zbMath Open vairavan.kMaRDI QIDQ3866019

List of research outcomes

Publication	Date of Publication	Type
The Computational Complexity of a Class of Minimization Algorithms for Switching Functions	1979-01-01	Paper
A Study of Schedules as Models of Synchronous Parallel Computation	1977-01-01	Paper
On the Computational Complexity of a Generalized Scheduling Problem	1976-01-01	Paper
The realization of consistent input-output sequences by Finite State Machines	1976-01-01	Paper
Some memory characteristics of incompletely specified sequential machines	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4138105	1974-01-01	Paper
Minimal Input-Memory and Output-Memory Finite-State Machines	1972-01-01	Paper
A Remark on the Concepts of Input-Memory and Output-Memory of Sequential Machines	1971-01-01	Paper
An exclusion principle for finite memory sequential machines	1971-01-01	Paper
Input-output relations of finite memory systems	1970-01-01	Paper
On the Lower Bound to the Memory of Finite State Machines	1969-01-01	Paper

Research outcomes over time

This page was built for person: K. Vairavan