Publication date
January 1968
DOIAbstract
Ph.D.MathematicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/187909/2/6912283.pd
Ph.D.MathematicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/187909/2/6912283.pd
Automata Theory is part of computability theory which covers problems in computer systems, software,...
International audienceDefine the complexity of a regular language as the number of states of its min...
Ph.D.MathematicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue....
PhDMathematicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.li...
http://deepblue.lib.umich.edu/bitstream/2027.42/8498/5/bad8097.0001.001.pdfhttp://deepblue.lib.umich...
Massachusetts Institute of Technology. Dept. of Electrical Engineering. Thesis. 1974. Ph.D.MICROFICH...
We consider control questions for finite automata viewed as input/output systems. In particular, we ...
Every automaton can be decomposed into a cascade of basic prime automata. This is the Prime Decompos...
http://deepblue.lib.umich.edu/bitstream/2027.42/7922/5/bad2801.0001.001.pdfhttp://deepblue.lib.umich...
The complexity of two finite-state models, optimizing transducers and counting automat
Ph.D.MathematicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue....
SIGLEAvailable from TIB Hannover: RN 2856(88-11) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - ...
A natural question regarding the limits of automation is: What are the limits of automata, or how cl...
This thesis examines the nature of complexity in automata networks, andin particular, the necessary ...
http://deepblue.lib.umich.edu/bitstream/2027.42/3959/5/bab8002.0001.001.pdfhttp://deepblue.lib.umich...
Automata Theory is part of computability theory which covers problems in computer systems, software,...
International audienceDefine the complexity of a regular language as the number of states of its min...
Ph.D.MathematicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue....
PhDMathematicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.li...
http://deepblue.lib.umich.edu/bitstream/2027.42/8498/5/bad8097.0001.001.pdfhttp://deepblue.lib.umich...
Massachusetts Institute of Technology. Dept. of Electrical Engineering. Thesis. 1974. Ph.D.MICROFICH...
We consider control questions for finite automata viewed as input/output systems. In particular, we ...
Every automaton can be decomposed into a cascade of basic prime automata. This is the Prime Decompos...
http://deepblue.lib.umich.edu/bitstream/2027.42/7922/5/bad2801.0001.001.pdfhttp://deepblue.lib.umich...
The complexity of two finite-state models, optimizing transducers and counting automat
Ph.D.MathematicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue....
SIGLEAvailable from TIB Hannover: RN 2856(88-11) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - ...
A natural question regarding the limits of automation is: What are the limits of automata, or how cl...
This thesis examines the nature of complexity in automata networks, andin particular, the necessary ...
http://deepblue.lib.umich.edu/bitstream/2027.42/3959/5/bab8002.0001.001.pdfhttp://deepblue.lib.umich...
Automata Theory is part of computability theory which covers problems in computer systems, software,...
International audienceDefine the complexity of a regular language as the number of states of its min...
Ph.D.MathematicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue....
Add to ORKG