Ph.D.MathematicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/182622/2/6001757.pd
http://deepblue.lib.umich.edu/bitstream/2027.42/4494/5/bab4731.0001.001.pdfhttp://deepblue.lib.umich...
http://deepblue.lib.umich.edu/bitstream/2027.42/3959/5/bab8002.0001.001.pdfhttp://deepblue.lib.umich...
Introduction Let D be some finite alphabet of symbols, (a set of "digits"). A numeration ...
PhDMathematicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.li...
http://deepblue.lib.umich.edu/bitstream/2027.42/4758/5/bac1496.0001.001.pdfhttp://deepblue.lib.umich...
Abstract: Finite automata are considered in this paper as instruments for classifying finite tapes. ...
Massachusetts Institute of Technology. Dept. of Electrical Engineering. Thesis. 1974. Ph.D.MICROFICH...
AbstractA finite automaton with multiplication (FAM) is a finite automaton with a register which is ...
PhDMathematicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.li...
http://deepblue.lib.umich.edu/bitstream/2027.42/5077/5/bac2694.0001.001.pdfhttp://deepblue.lib.umich...
SIGLEAvailable from British Library Document Supply Centre- DSC:D84288 / BLDSC - British Library Doc...
AbstractThis paper deals with finite-memory automata, introduced in Kaminski and Francez (Theoret. C...
AbstractA class of decision problems is Boolean if it is closed under the set-theoretic operations o...
We study several classical decision problems on finite automata under the (Strong) Exponential Time ...
Ph.D.MathematicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue....
http://deepblue.lib.umich.edu/bitstream/2027.42/4494/5/bab4731.0001.001.pdfhttp://deepblue.lib.umich...
http://deepblue.lib.umich.edu/bitstream/2027.42/3959/5/bab8002.0001.001.pdfhttp://deepblue.lib.umich...
Introduction Let D be some finite alphabet of symbols, (a set of "digits"). A numeration ...
PhDMathematicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.li...
http://deepblue.lib.umich.edu/bitstream/2027.42/4758/5/bac1496.0001.001.pdfhttp://deepblue.lib.umich...
Abstract: Finite automata are considered in this paper as instruments for classifying finite tapes. ...
Massachusetts Institute of Technology. Dept. of Electrical Engineering. Thesis. 1974. Ph.D.MICROFICH...
AbstractA finite automaton with multiplication (FAM) is a finite automaton with a register which is ...
PhDMathematicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.li...
http://deepblue.lib.umich.edu/bitstream/2027.42/5077/5/bac2694.0001.001.pdfhttp://deepblue.lib.umich...
SIGLEAvailable from British Library Document Supply Centre- DSC:D84288 / BLDSC - British Library Doc...
AbstractThis paper deals with finite-memory automata, introduced in Kaminski and Francez (Theoret. C...
AbstractA class of decision problems is Boolean if it is closed under the set-theoretic operations o...
We study several classical decision problems on finite automata under the (Strong) Exponential Time ...
Ph.D.MathematicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue....
http://deepblue.lib.umich.edu/bitstream/2027.42/4494/5/bab4731.0001.001.pdfhttp://deepblue.lib.umich...
http://deepblue.lib.umich.edu/bitstream/2027.42/3959/5/bab8002.0001.001.pdfhttp://deepblue.lib.umich...
Introduction Let D be some finite alphabet of symbols, (a set of "digits"). A numeration ...