Add to ORKGThe complexity of two finite-state models, optimizing transducers and counting automat
Complementation and determinization are two fundamental notions in automata the-ory. The close relat...
Slower paced than 6.840J/18.404J. Introduces basic mathematical models of computation and the finite...
PhDMathematicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.li...
An optimizing finite-state transducer is a nondeterministic finite-state transducer in which states ...
AbstractAn optimizing finite-state transducer is a nondeterministic finite-state transducer in which...
Over the last 30 years or so many results have appeared on the descriptional complexity of machines ...
The existence of a substantial gap between deterministic and nondeterministic two-way automata is on...
In this paper we define a new descriptional complexity measure for Deterministic Finite Automata, BC...
AbstractIn this paper we develop a version of Algorithmic Information Theory (AIT) based on finite t...
In this paper we develop a version of Algorithmic Information Theory (AIT) by replacing Turing machi...
The notion of two-way automata was introduced at the very beginning of automata theory. In 1959, Rab...
AbstractWatson–Crick automata are finite state automata working on double-stranded tapes, introduced...
We consider control questions for finite automata viewed as input/output systems. In particular, we ...
Abstract. We try to compare the complexity of deterministic, nonde-terministic, probabilistic and ul...
SIGLEAvailable from TIB Hannover: RO 9119(2001,3) / FIZ - Fachinformationszzentrum Karlsruhe / TIB -...
Complementation and determinization are two fundamental notions in automata the-ory. The close relat...
Slower paced than 6.840J/18.404J. Introduces basic mathematical models of computation and the finite...
PhDMathematicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.li...
An optimizing finite-state transducer is a nondeterministic finite-state transducer in which states ...
AbstractAn optimizing finite-state transducer is a nondeterministic finite-state transducer in which...
Over the last 30 years or so many results have appeared on the descriptional complexity of machines ...
The existence of a substantial gap between deterministic and nondeterministic two-way automata is on...
In this paper we define a new descriptional complexity measure for Deterministic Finite Automata, BC...
AbstractIn this paper we develop a version of Algorithmic Information Theory (AIT) based on finite t...
In this paper we develop a version of Algorithmic Information Theory (AIT) by replacing Turing machi...
The notion of two-way automata was introduced at the very beginning of automata theory. In 1959, Rab...
AbstractWatson–Crick automata are finite state automata working on double-stranded tapes, introduced...
We consider control questions for finite automata viewed as input/output systems. In particular, we ...
Abstract. We try to compare the complexity of deterministic, nonde-terministic, probabilistic and ul...
SIGLEAvailable from TIB Hannover: RO 9119(2001,3) / FIZ - Fachinformationszzentrum Karlsruhe / TIB -...
Complementation and determinization are two fundamental notions in automata the-ory. The close relat...
Slower paced than 6.840J/18.404J. Introduces basic mathematical models of computation and the finite...
PhDMathematicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.li...