Titlebook: Language and Automata Theory and Applications; 13th International C Carlos Martín-Vide,Alexander Okhotin,Dana Shapira Conference proceeding

white-matter

爭吵加

槍支

Observation and Interactionwerful than observation. Observation is the use of input data plus, possibly, tractable computation, in such a way that the observer has no effect on the source of the data. Interaction is observation plus action that affects the source of the data. Observation lets the data “speak for itself” and i

THROB

Vital-Signs

保全

Orbits of Abelian Automaton Groupsdki?[.], we describe a useful embedding of abelian automaton groups into a corresponding algebraic number field, and give a polynomial time algorithm to compute this embedding. We apply this technique to study iteration of transductions in abelian automaton groups. Specifically, properties of this n

烤架

Decidability of Sensitivity and Equicontinuity for Linear Higher-Order Cellular Automatat time . only depends on the state at time ., while in HOCA it is a function of the states at time ., ..., ., where . is the memory size. In particular, we provide easy-to-check necessary and sufficient conditions for a linear HOCA over . of memory size . to be sensitive to the initial conditions or

FLIC

On Varieties of Ordered Automatace have been found with more general classes of regular languages on one hand and classes of more complex algebraic structures on the other hand. It is also possible to consider classes of automata instead of algebraic structures as a natural counterpart of classes of languages. Here we deal with th

NOT

Automata over Infinite Sequences of Realseal numbers. The present paper continues the study of (a variant) of this model dealing with computations on infinite strings of reals. Our results support the view that this is a suitable model of finite automata over the real numbers. We define Büchi and Muller versions of the model and show, amon

細(xì)查

Nonuniform Families of Polynomial-Size Quantum Finite Automata and Quantum Logarithmic-Space Computa. 275–286] were concerned with nonuniform families of finite automata and they discussed the behaviors of nonuniform complexity classes defined by families of such finite automata having polynomial-size state complexity. In a similar fashion, we introduce nonuniform state complexity classes using fa