Search results for "Cellular Automata"

showing 10 items of 113 documents

Ultrametric Algorithms and Automata

2015

We introduce a notion of ultrametric automata and Turing machines using p-adic numbers to describe random branching of the process of computation. These automata have properties similar to the properties of probabilistic automata but complexity of probabilistic automata and complexity of ultrametric automata can differ very much.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESTheoretical computer scienceFinite-state machineComputer scienceComputationStochastic matrixNonlinear Sciences::Cellular Automata and Lattice GasesAutomatonTuring machinesymbols.namesakeTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESProbabilistic automatonsymbolsAutomata theoryUltrametric spaceComputer Science::Formal Languages and Automata TheoryMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

Automata and forbidden words

1998

Abstract Let L ( M ) be the (factorial) language avoiding a given anti-factorial language M . We design an automaton accepting L ( M ) and built from the language M . The construction is effective if M is finite. If M is the set of minimal forbidden words of a single word ν, the automaton turns out to be the factor automaton of ν (the minimal automaton accepting the set of factors of ν). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a nontrivial upper bound on the number of minimal forbidden words of a word.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Büchi automaton0102 computer and information sciences02 engineering and technologyω-automaton01 natural sciencesTheoretical Computer ScienceCombinatoricsDeterministic automaton0202 electrical engineering electronic engineering information engineeringTwo-way deterministic finite automatonNondeterministic finite automatonMathematicsPowerset constructionLevenshtein automaton020206 networking & telecommunicationsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Nonlinear Sciences::Cellular Automata and Lattice GasesComputer Science ApplicationsTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES010201 computation theory & mathematicsSignal ProcessingProbabilistic automatonComputer Science::Programming LanguagesComputer Science::Formal Languages and Automata TheoryInformation Systems
researchProduct

Minimal forbidden words and factor automata

1998

International audience; Let L(M) be the (factorial) language avoiding a given antifactorial language M. We design an automaton accepting L(M) and built from the language M. The construction is eff ective if M is finite. If M is the set of minimal forbidden words of a single word v, the automaton turns out to be the factor automaton of v (the minimal automaton accepting the set of factors of v). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a non-trivial upper bound on the number of minimal forbidden words of a word.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESfailure functionfactor code[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Büchi automatonComputerApplications_COMPUTERSINOTHERSYSTEMS[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information sciencesavoiding a wordω-automaton01 natural sciencesfactorial languageReversible cellular automatonCombinatoricsDeterministic automatonanti-factorial languageNondeterministic finite automaton0101 mathematicsMathematicsfactor automatonPowerset constructionLevenshtein automaton010102 general mathematicsforbidden wordComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)16. Peace & justiceNonlinear Sciences::Cellular Automata and Lattice GasesTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES010201 computation theory & mathematicsProbabilistic automatonPhysics::Accelerator PhysicsComputer Science::Programming LanguagesHigh Energy Physics::ExperimentComputer Science::Formal Languages and Automata Theory
researchProduct

Digital calculus: Cellular automata dynamics in closed form

2015

A simple mathematical expression for the universal map for cellular automata is found in closed form with the help of a digit function, whose most basic properties are established. This result is found after proving a theorem on the composition of functions on finite sets. The expression (and the technique used to obtain it) opens the possibility of gaining mathematical insight in any cellular automaton rule since it constitutes at the same time a simple and fast algorithm to implement any such rule.

TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESCellular Automata and Lattice Gases (nlin.CG)FOS: Physical sciencesNonlinear Sciences::Cellular Automata and Lattice GasesNonlinear Sciences - Cellular Automata and Lattice Gases
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

Coupling Cellular Automata and Markov Chains to Design prospective Scenarios of Urbanization. An application to Strasbourg Cross-border Area

2016

International audience

[SHS.GEO] Humanities and Social Sciences/Geographycellular automataMarkoc chainsurbanization[SHS.GEO]Humanities and Social Sciences/GeographyComputingMilieux_MISCELLANEOUS[ SHS.GEO ] Humanities and Social Sciences/Geography
researchProduct

Land use simulation: statistical analysis approaches to calibrate cellular automata

2015

International audience

[SHS.GEO] Humanities and Social Sciences/Geographycellular automata[SHS.GEO]Humanities and Social Sciences/GeographyLand use simulationComputingMilieux_MISCELLANEOUS[ SHS.GEO ] Humanities and Social Sciences/Geography
researchProduct

Constraint Cellular Automata for Urban Development simulation. An Application to Strasbourg Cross-border Area

2015

International audience

[SHS.GEO] Humanities and Social Sciences/Geographycellular automata[SHS.GEO]Humanities and Social Sciences/Geographyurban developmentComputingMilieux_MISCELLANEOUS[ SHS.GEO ] Humanities and Social Sciences/Geography
researchProduct

SYSTEM DYNAMICS VERSUS CELLULAR AUTOMATA IN MODELLING PANIC SITUATIONS

2008

International audience; In this paper we face system dynamics modelling and cellular automata to model panic processes. We compare both models using phase plans. The results of simulation confirm our hypotheses: First, a collective behaviour is not the arithmetical sum of the individual behaviours. Secondly the crowd causes the emergence of collective panic from individual panic. Both types of methodology produce the emergence of panic and identical curves for different values of initial conditions and parameters. But the effects of thresholds vary according to these values.

[SHS.GEO] Humanities and Social Sciences/Geographycellular automatapanicemergencesystem dynamics modelling[SHS.GEO]Humanities and Social Sciences/Geographysimulation[ SHS.GEO ] Humanities and Social Sciences/Geography
researchProduct

Machine learning for land use change analysis and modelling.

2019

Urban development can take different forms or features, depending on its geographical location and its socioeconomic, political and cultural context. Nevertheless, the overall action relies on one fundamental principle: building construction in order to give people housing. Therefore, the main objective of this research is to determine whether an underlying universal aspect of the urban development process can be distinguished from a specific one, being the reflect of local specificities. Specifically, this research analyzes the land use change on the French-German cross-border area. Indeed, the border context enhances the difference within this territory. Nonetheless, the internal European…

border areaArbre de décisionStrasbourg Kehlcellular automatazone frontalière[SHS.GEO] Humanities and Social Sciences/Geographydecision treeautomate cellulaireland usemodelingoccupation du solmodélisation
researchProduct