Search results for "Nonlinear"

showing 10 items of 3684 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

A remark on hyperplane sections of rational normal scrolls

2017

We present algebraic and geometric arguments that give a complete classification of the rational normal scrolls that are hyperplane section of a given rational normal scrolls.

TheoryofComputation_MISCELLANEOUSMathematics::Commutative AlgebraInformationSystems_INFORMATIONINTERFACESANDPRESENTATION(e.g.HCI)Determinantal idealsMSC: Primary 14M12 13C40Quantitative Biology::Tissues and Organs[MATH.MATH-AG] Mathematics [math]/Algebraic Geometry [math.AG]Mathematics - Commutative AlgebraCommutative Algebra (math.AC)[ MATH.MATH-AG ] Mathematics [math]/Algebraic Geometry [math.AG]Mathematics - Algebraic GeometryComputingMethodologies_PATTERNRECOGNITIONMathematics::Algebraic GeometryComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONComputingMethodologies_DOCUMENTANDTEXTPROCESSINGFOS: MathematicsRational normal scrolls[MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG]Nonlinear Sciences::Pattern Formation and SolitonsAlgebraic Geometry (math.AG)
researchProduct

On the propagation of a perturbation in an anharmonic system

2007

We give a not trivial upper bound on the velocity of disturbances in an infinitely extended anharmonic system at thermal equilibrium. The proof is achieved by combining a control on the non equilibrium dynamics with an explicit use of the state invariance with respect to the time evolution.

Thermal equilibriumPhysicsAnharmonicityTime evolutionAnharmonic crystals; Propagation velocity; Statistical and Nonlinear Physics; Mathematical PhysicsPerturbation (astronomy)FOS: Physical sciencesStatistical and Nonlinear Physicsanharmonic crystals; propagation velocityMathematical Physics (math-ph)Upper and lower bounds82C05 82D20Classical mechanicsPropagation velocityAnharmonic crystalsSettore MAT/07 - Fisica MatematicaMathematical Physics
researchProduct

Quantum dynamics of the intensity-dependent Tavis-Cummings model

1999

An exactly solvable generalization of the intensity-dependent Jaynes-Cummings model to the case of N0 atoms is introduced together with its solution. The quantum dynamics of the model including the squeezing properties of the su(1,1) Perelomov and Glauber coherent states is investigated. The cases of one and two atoms present in the cavity are analysed in detail. These two cases are compared in the situation when the atomic subsystem is initially prepared in the ground state, the Dicke state and the state of thermal equilibrium.

Thermal equilibriumPhysicsGeneralizationQuantum dynamicsGeneral Physics and AstronomyStatistical and Nonlinear PhysicsQuantum PhysicsState (functional analysis)Dark stateQuantum mechanicsQuantum electrodynamicsCoherent statesGround stateGlauberMathematical PhysicsJournal of Physics A: Mathematical and General
researchProduct

Thermalization and condensation in an incoherently pumped passive optical cavity

2011

International audience; We study theoretically and numerically the condensation and the thermalization of classical optical waves in an incoherently pumped passive Kerr cavity. We show that the dynamics of the cavity exhibits a turbulent behavior that can be described by the wave turbulence theory. A mean-field kinetic equation is derived, which reveals that, in its high finesse regime, the cavity behaves essentially as a conservative Hamiltonian system. In particular, the intracavity turbulent field is shown to relax adiabatically toward a thermodynamic equilibrium state of energy equipartition. As a consequence of this effect of wave thermalization, the incoherent optical field undergoes …

Thermodynamic equilibriumPlane wavePhysics::OpticsOptical fieldFrequency conversionincluding higher-order harmonic generation01 natural sciencesoptical instabilitiesharmonic generationlaw.inventionSchrödinger equation010309 opticssymbols.namesakelawQuantum mechanicsDynamics of nonlinear optical systems0103 physical sciences010306 general physicsEquipartition theoremPhysics[PHYS.PHYS.PHYS-OPTICS]Physics [physics]/Physics [physics]/Optics [physics.optics][ PHYS.PHYS.PHYS-OPTICS ] Physics [physics]/Physics [physics]/Optics [physics.optics]and optical spatio-temporal dynamicsAtomic and Molecular Physics and OpticsOptical cavityQuantum electrodynamicssymbolsDissipative systemoptical chaos and complexityHamiltonian (quantum mechanics)Coherence
researchProduct

Asymptotics for third-order nonlinear differential equations: Non-oscillatory and oscillatory cases

2022

We discuss a third-order differential equation, involving a general form of nonlinearity. We obtain results describing how suitable coefficient functions determine the asymptotic and (non-)oscillatory behavior of solutions. We use comparison technique with first-order differential equations together with the Kusano–Naito’s and Philos’ approaches.

Third order nonlinearOscillation and non-oscillationDifferential equationGeneral MathematicsComparison technique010102 general mathematicsMathematical analysis01 natural sciencesAsymptotic behavior010101 applied mathematicsSettore MAT/05 - Analisi Matematica0101 mathematicsThird-order differential equationNonlinear differential equationMathematics
researchProduct

A method for the time-varying nonlinear prediction of complex nonstationary biomedical signals

2009

A method to perform time-varying (TV) nonlinear prediction of biomedical signals in the presence of nonstationarity is presented in this paper. The method is based on identification of TV autoregressive models through expansion of the TV coefficients onto a set of basis functions and on k -nearest neighbor local linear approximation to perform nonlinear prediction. The approach provides reasonable nonlinear prediction even for TV deterministic chaotic signals, which has been a daunting task to date. Moreover, the method is used in conjunction with a TV surrogate method to provide statistical validation that the presence of nonlinearity is not due to nonstationarity itself. The approach is t…

Time FactorsComputer scienceSpeech recognitionChaoticBiomedical EngineeringBasis functionModels BiologicalSurrogate dataYoung AdultHeart RatePredictive Value of TestsNonstationary signalHumansComputer SimulationEEGPredictabilitySignal processingNonlinear dynamicElectroencephalographySignal Processing Computer-AssistedComplexityLocal nonlinear predictionNonlinear systemNonlinear DynamicsAutoregressive modelData Interpretation StatisticalSettore ING-INF/06 - Bioingegneria Elettronica E InformaticaLinear approximationSurrogate dataAlgorithmHeart rate variability (HRV)Algorithms
researchProduct