Ilja V. Petrov

Learn More
A word w over a finite alphabet Σ is n-collapsing if for an arbitrary deterministic finite automaton A = 〈Q,Σ, δ〉, the inequality |δ(Q,w)| ≤ |Q| − n holds provided that |δ(Q, u)| ≤ |Q| − n for some word u ∈ Σ (depending on A ). We prove that the the property of being n-collapsing is algorithmically recognizable for any given positive integer n. We also(More)
The phenomenon of collapse of Langmuir waves this problem is the computer simulation of the plasma [1] consists of the spontaneous appearance of low by the PlC-method. This method presents a number density regions (cavities) in a plasma filled with conof difficulties which may explain why an exact kinetic fined electron plasma oscillations. After a finite(More)
  • 1