We introduce a quantum-like classical computational model, called affine computation, as a generalization of probabilistic computation. After giving the basics of affine computation, we define affine finite automata (AfA) and compare it with quantum and probabilistic finite automata (QFA and PFA, respectively) with respect to three basic language recognition modes. We show that, in the cases of...

Introdução: As taxas de excesso peso aumentaram significativamente desde 1975 entre crianças e adolescentes, com isso a obesidade tornou-se um problema saúde pública devido ao elevado risco complicações associadas gordura corporal, sendo fator para o desenvolvimento doenças não transmissíveis (DCNTs). Objetivo: Analisar consumo alimentar bioquímico obesos internados em hospital referência cardi...

We exhibit a family {Ln} of finite regular languages such that any 1-way quantum finite automaton (QFA) accepting Ln with probability 1 2 + ǫ (for any constant ǫ > 0) must have 2 Ω(n/ logn) states. On the other hand, each language Ln can be recognized by a deterministic finite automaton (DFA) of size O(n). This is in immediate contrast to the result of [1] which shows that for some regular lang...

Resumo Este estudo tem como objetivo analisar a associação entre adesão à alimentação escolar e coocorrência do consumo regular de marcadores saudável não adolescentes brasileiros. Foram avaliados 67.881 escolas públicas brasileiras participantes da Pesquisa Nacional Saúde Escolar (PeNSE) 2015. A partir QFA sete dias, construiu-se variável dependente, (≥ 5x/semana) saudável, que foi categorizad...

We obtain several lower bounds on the language recognition power of Nayak’s [12] generalized quantum finite automata (GQFA). Techniques for proving lower bounds on Kondacs and Watrous’ one-way quantum finite automata (KWQFA) were introduced by Ambainis and Freivalds [2], and were expanded in a series of papers. We show that many of these techniques can be adapted to prove lower bounds for GQFAs...

The nondeterministic quantum finite automaton (NQFA) is the only known case where a one-way quantum finite automaton (QFA) model has been shown to be strictly superior in terms of language recognition power to its probabilistic counterpart. We give a characterization of the class of languages recognized by NQFA's, demonstrating that it is equal to the class of exclusive stochastic languages. We...

The aim of this appendix is to construct concrete groups which simultaneously: (1) are boundedly generated; (2) have Kazhdan’s property (T); (3) have a one-dimensional space of pseudocharacters. By (3), such groups don’t have property (QFA), whilst they have property (FA) by (2); moreover the quasimorphisms in (3) cannot be bushy in the sense of [9]. Property (3) has its own interest, as all pr...

We consider 1-way quantum finite automata (QFAs). First, we compare them with their classical counterparts. We show that, if an automaton is required to give the correct answer with a large probability (over 9/10), then the power of 1-way QFAs is equal to the power of 1-way reversible automata. However, quantum automata giving the correct answer with smaller probabilities are more powerful than...

O presente estudo teve como objetivo avaliar a ingestão diária de cálcio e verificar frequência doenças ósseas em idosos atendidos na policlínica da terceira idade do município Caruaru/PE. Foi aplicado um questionário alimentar (QFA) para cálcio. Verificou-se que dos participantes 61,49% apresentaram ósseas, sendo 95,60% sexo feminino 4,40% masculino. Em relação ao consumo leite seus derivados ...