This is a talk on minicomplexity, namely on the complexity of two-way finite automata. We
start with a smooth introduction to its basic concepts, which also brings together several …

The Formal Language Theory Column Page 1 The Formal Language Theory Column by
Giovanni Pighizzini Dipartimento di Informatica Università degli Studi di Milano 20135 Milano …

Let L/poly and NL be the standard complexity classes, of languages recognizable in
logarithmic space by Turing machines which are deterministic with polynomially-long advice …

Capsules provide an algebraic representation of the state of a computation in higher-order
functional and imperative languages. A capsule is essentially a finite coalgebraic …

The notion of two-way automata was introduced at the very beginning of automata theory. In
1959, Rabin and Scott and, independently, Shepherdson, proved that these models, both in …

We introduce a new type of nonuniform two-way automaton that can use a different transition
function for each tape square. We also enhance this model by allowing to shuffle the given …

Let L/poly and NL be the standard complexity classes, of languages recognizable in
logarithmic space by Turing machines which are deterministic with polynomially-long advice …

This work investigates the controllability of finite state machines with the help of the semi-
tensor product of matrices (STP), which is a new matrix analysis tool proposed in recent …

Finite-state automaton is a machine that processes input strings and produces output
indicating whether the input string is accepted or not. It is an acceptor recognizer for input …

The notion of two-way automata was introduced at the very beginning of automata theory. In
1959, Rabin and Scott and, independently, Shepherdson, proved that these models, both in …