Search results for "Automaton"

showing 10 items of 257 documents

Self-trapping of charge polarized states in four-dot molecular quantum cellular automata: bi-electronic tetrameric mixed-valence species

2014

Abstract Our interest in this article is prompted by the problem of the vibronic self-trapping of charge polarized states in the four-dot molecular quantum cellular automata (mQCA), a paradigm for nanoelectronics, in which binary information is encoded in charge configuration of the mQCA cell. We report the evaluation of the electronic states and the adiabatic potentials of mixed-valence (MV) systems in which two electrons (or holes) are shared among four sites. These systems are exemplified by the two kinds of tetra–ruthenium (2Ru(II)+ 2Ru(III)) clusters (assembled as two coupled Creutz–Taube dimers) for which molecular implementation of mQCA was proposed. The tetra–ruthenium clusters incl…

Valence (chemistry)Condensed matter physicsChemistryChemical physicsGeneral Chemical EngineeringGeneral ChemistryTrappingQuantum cellular automatonPure and Applied Chemistry
researchProduct

Visual spike-based convolution processing with a Cellular Automata architecture

2010

this paper presents a first approach for implementations which fuse the Address-Event-Representation (AER) processing with the Cellular Automata using FPGA and AER-tools. This new strategy applies spike-based convolution filters inspired by Cellular Automata for AER vision processing. Spike-based systems are neuro-inspired circuits implementations traditionally used for sensory systems or sensor signal processing. AER is a neuromorphic communication protocol for transferring asynchronous events between VLSI spike-based chips. These neuro-inspired implementations allow developing complex, multilayer, multichip neuromorphic systems and have been used to design sensor chips, such as retinas an…

Very-large-scale integrationSignal processingTheoretical computer scienceArtificial neural networkComputer sciencebusiness.industrySensory systemCellular automatonConvolutionNeuromorphic engineeringAsynchronous communicationSpike (software development)businessComputer hardwareThe 2010 International Joint Conference on Neural Networks (IJCNN)
researchProduct

AER Filtering Using GLIDER: VHDL Cellular Automata Description

2008

Cellular Automata (CA) is a bio-inspired processing model for problem solving, initially proposed by Von Neumann. This approach modularizes the processing by dividing the solution into synchronous cells that change their states at the same time in order to get the solution. The communication between them is crucial to achieve the correct solution. On the other hand, the Address-Event-Representation (AER) is a neuromorphic communication protocol for transferring asynchronous events between VLSI chips. These neuro-inspired implementations have been used to design sensor chips (retina, cochleas), processing chips (convolutions, filters) and learning chips, which makes it possible to develop co…

Very-large-scale integrationbusiness.industryComputer scienceHardware description languageFilter (signal processing)Cellular automatonNeuromorphic engineeringAsynchronous communicationEmbedded systemVHDLbusinesscomputerDigital filterComputer hardwarecomputer.programming_language
researchProduct

Quantum Cellular Automata: a Short Overview of Molecular Problem

2018

International audience

[CHIM.THEO]Chemical Sciences/Theoretical and/or physical chemistryPhysicsTheoretical computer scienceGeneral Physics and Astronomy02 engineering and technology010402 general chemistry021001 nanoscience & nanotechnology0210 nano-technology01 natural sciencesComputingMilieux_MISCELLANEOUS0104 chemical sciencesQuantum cellular automatonActa Physica Polonica A
researchProduct

Topological properties of cellular automata on trees

2012

We prove that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k>=2). Moreover, we investigate some topological properties of these automata and their relationships, namely permutivity, surjectivity, preinjectivity, right-closingness and openness.

[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]FOS: Computer and information sciencesDiscrete Mathematics (cs.DM)Formal Languages and Automata Theory (cs.FL)FOS: Physical sciencesComputer Science - Formal Languages and Automata Theory0102 computer and information sciences[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Computational Complexity (cs.CC)Topology01 natural scienceslcsh:QA75.5-76.95[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]0101 mathematicsF.1.1;F.1.2;F.1.3MathematicsCellular Automata and Lattice Gases (nlin.CG)lcsh:Mathematics010102 general mathematicsCellular automaton tree shift expansivity permutivity right-closingness opennesslcsh:QA1-939Nonlinear Sciences::Cellular Automata and Lattice GasesCellular automatonAutomatonComputer Science - Computational Complexity010201 computation theory & mathematicsTree (set theory)lcsh:Electronic computers. Computer scienceF.1.2F.1.3ExpansiveNonlinear Sciences - Cellular Automata and Lattice GasesF.1.1Computer Science::Formal Languages and Automata TheoryComputer Science - Discrete Mathematics
researchProduct

Probability and algorithmics: a focus on some recent developments

2017

Jean-François Coeurjolly, Adeline Leclercq-Samson Eds.; International audience; This article presents different recent theoretical results illustrating the interactions between probability and algorithmics. These contributions deal with various topics: cellular automata and calculability, variable length Markov chains and persistent random walks, perfect sampling via coupling from the past. All of them involve discrete dynamics on complex random structures.; Cet article présente différents résultats récents de nature théorique illustrant les interactions entre probabilités et algorithmique. Ces contributions traitent de sujets variés : automates cellulaires et calculabilité, chaînes de Mark…

[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]T57-57.97Focus (computing)Applied mathematics. Quantitative methodsTheoretical computer scienceMarkov chainComputer science[MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Variable lengthRandom walkCellular automaton[INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]Perfect sampling[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]Coupling from the past[INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT][INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]Algorithmics[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]QA1-939Mathematics
researchProduct

On the suffix automaton with mismatches

2007

International audience; In this paper we focus on the construction of the minimal deterministic finite automaton S_k that recognizes the set of suffixes of a word w up to k errors. We present an algorithm that makes use of S_k in order to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r, where r is the value of the repetition index of w. Moreover, we give some experimental results on some well-known words, like prefixes of Fibonacci and Thue-Morse words, and we make a conjecture on the size of the suffix automaton with mismatches.

approximate string matchingFibonacci numberlanguages with mismatches[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Generalized suffix treeBüchi automatonComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)0102 computer and information sciences02 engineering and technology01 natural sciencesCombinatoricsPrefixCombinatorics on wordsDeterministic finite automaton010201 computation theory & mathematics0202 electrical engineering electronic engineering information engineeringSuffix automaton020201 artificial intelligence & image processingsuffix automatacombinatorics on wordsComputer Science::Data Structures and Algorithmscombinatorics on words suffix automata languages with mismatches approximate string matchingWord (computer architecture)Computer Science::Formal Languages and Automata TheoryMathematics
researchProduct

A trie-based approach for compacting automata

2004

International audience; We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression and does not need to retain the input string, differently from other methods based on compact automata. The net effect is that of obtaining a lighter automaton than the directed acyclic word graph (DAWG) of Blumer et al., as it uses less nodes, still with arcs labeled by single characters.

automataComputer scienceSuffix tree[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]suffix tree0102 computer and information sciences02 engineering and technologyω-automaton01 natural sciencesindex text compressionlaw.inventionlawfactor and suffixTrie0202 electrical engineering electronic engineering information engineeringAutomata and formal languagesPattern matchingDirected acyclic word graphString (computer science)Directed graphDirected acyclic graphMobile automatonAutomaton010201 computation theory & mathematics020201 artificial intelligence & image processingAlgorithmComputer Science::Formal Languages and Automata Theory
researchProduct

A Bayesian Learning Automata-Based Distributed Channel Selection Scheme for Cognitive Radio Networks

2014

We consider a scenario where multiple Secondary Users SUs operate within a Cognitive Radio Network CRN which involves a set of channels, where each channel is associated with a Primary User PU. We investigate two channel access strategies for SU transmissions. In the first strategy, the SUs will send a packet directly without operating Carrier Sensing Medium Access/Collision Avoidance CSMA/CA whenever a PU is absent in the selected channel. In the second strategy, the SUs implement CSMA/CA to further reduce the probability of collisions among co-channel SUs. For each strategy, the channel selection problem is formulated and demonstrated to be a so-called "Potential" game, and a Bayesian Lea…

business.industryNetwork packetComputer scienceBayesian inferenceAutomatonsymbols.namesakeCognitive radioNash equilibriumConvergence (routing)symbolsbusinessPotential gameSimulationCommunication channelComputer network
researchProduct

Morphological similarities between DBM and an economic geography model of city growth

2009

International audience; An urban microeconomic model of households evolving in a 2Dcellular automata allows to simulate the growth of a metropolitan area whereland is devoted to housing, road network and agricultural/green areas. Thissystem is self-organised: based on individualistic decisions of economic agentswho compete on the land market, the model generates a metropolitan area withhouses, roads, and agriculture. Several simulation are performed. The resultsshow strong similarities with physical Dieletric breackdown models (DBM). Inparticular, phase transitions in the urban morphology occur when a controlparameter reaches critical values. Population density in our model and theelectric …

business.industry[SHS.GEO] Humanities and Social Sciences/GeographyRoad NetworkUrban morphologyEconomic agentsFractal Dimension[SHS.GEO]Humanities and Social Sciences/Geography01 natural sciencesMetropolitan areaCellular automatonCentral Business District[ SHS.GEO ] Humanities and Social Sciences/Geography010305 fluids & plasmasGeographyAgricultureCellular Automaton0103 physical sciencesLand marketEconomic geography010306 general physicsbusinessCentral business district
researchProduct