Add to ORKGThis report summarizes the results obtained in research supported by the National Science Foundation Grant AUTOMATA AND COMPUTATIONAL COMPLEXITY. The report lists the problem areas considered, the publications resulting from this work and gives an outline of the more recent research results which have not yet been published
This dissertation formalizes a comprehensive approach based on compiler technology to simulate some ...
This book was originally written in 1969 by Berkeley mathematician John Rhodes. It is the founding w...
This is a semiannual progress report about a program of research in the field of Artificial Intellig...
http://deepblue.lib.umich.edu/bitstream/2027.42/3962/5/bab9693.0001.001.pdfhttp://deepblue.lib.umich...
The results of the investigations that received support from this grant are described in research pa...
http://deepblue.lib.umich.edu/bitstream/2027.42/3953/5/bab6942.0001.001.pdfhttp://deepblue.lib.umich...
http://deepblue.lib.umich.edu/bitstream/2027.42/3963/5/bab9694.0001.001.pdfhttp://deepblue.lib.umich...
http://deepblue.lib.umich.edu/bitstream/2027.42/3931/5/bac0128.0001.001.pdfhttp://deepblue.lib.umich...
Automata Theory is part of computability theory which covers problems in computer systems, software,...
http://deepblue.lib.umich.edu/bitstream/2027.42/3332/5/bab0491.0001.001.pdfhttp://deepblue.lib.umich...
Slower paced than 6.840J/18.404J. Introduces basic mathematical models of computation and the finite...
This paper gives a personal account of some developments in automata theory and computational compl...
The complexity of two finite-state models, optimizing transducers and counting automat
The Nuprl proof development system was designed for the computer-assisted problem solving in mathem...
This report documents the program and the outcomes of Dagstuhl Seminar 15392 "Measuring the Complexi...
This dissertation formalizes a comprehensive approach based on compiler technology to simulate some ...
This book was originally written in 1969 by Berkeley mathematician John Rhodes. It is the founding w...
This is a semiannual progress report about a program of research in the field of Artificial Intellig...
http://deepblue.lib.umich.edu/bitstream/2027.42/3962/5/bab9693.0001.001.pdfhttp://deepblue.lib.umich...
The results of the investigations that received support from this grant are described in research pa...
http://deepblue.lib.umich.edu/bitstream/2027.42/3953/5/bab6942.0001.001.pdfhttp://deepblue.lib.umich...
http://deepblue.lib.umich.edu/bitstream/2027.42/3963/5/bab9694.0001.001.pdfhttp://deepblue.lib.umich...
http://deepblue.lib.umich.edu/bitstream/2027.42/3931/5/bac0128.0001.001.pdfhttp://deepblue.lib.umich...
Automata Theory is part of computability theory which covers problems in computer systems, software,...
http://deepblue.lib.umich.edu/bitstream/2027.42/3332/5/bab0491.0001.001.pdfhttp://deepblue.lib.umich...
Slower paced than 6.840J/18.404J. Introduces basic mathematical models of computation and the finite...
This paper gives a personal account of some developments in automata theory and computational compl...
The complexity of two finite-state models, optimizing transducers and counting automat
The Nuprl proof development system was designed for the computer-assisted problem solving in mathem...
This report documents the program and the outcomes of Dagstuhl Seminar 15392 "Measuring the Complexi...
This dissertation formalizes a comprehensive approach based on compiler technology to simulate some ...
This book was originally written in 1969 by Berkeley mathematician John Rhodes. It is the founding w...
This is a semiannual progress report about a program of research in the field of Artificial Intellig...