Atanas Marinov Atanassov
ABSTRACT
A possibility is examined for synthesis of the control model of a photometric complex for investigation of the middle atmosphere night glow on the basis of asynchronous finite automata. The means for implementation of the suggested approach are examined. The advantage of this approach is expressed in the model flexibility.
- {1}. Atanassov At., L. Bankov, K. Kanev, N. Petkov, G.Hristov. Measurement Control And Data Registration Applied To Photometric System For Atmospheric Investigation. Proceedings of Scientific Conference of the Technical University of Gabrovo, 14-15 October 1999, v.I, p.161-166., (bul).Google Scholar
- {2}. Atanassov At., L Bankov, K. Kanev, N. Petkov, G. Hristov. Development of a Computer Model to Control a Scanning Photometric System for Atmospheric Investigations. IV General Conference of the Balkan Physical Union, 22-25 August 2000, Veliko Tarnovo, Bulgaria.Google Scholar
- {3}. Atanassov A., Control Model Of A Photometric System For Zenith Measurements, Presented By Parallel Finite Automata, Proceedings of 9th National Conference: "Main Problems of the Solar-Terrestrial Interactions.", 21-22, November 2002, Sofia, pp. 177-179.Google Scholar
- {4}. Atanassov A., L. Bankov, N. Petkov, A Possibility For Control of a Filter Disk In Photometric Systems, SATI Type, Proceedings of Scientific Conference of Stara Zagora Union of Scientists, 2001, 78-82pp.Google Scholar
- {5}. Atanassov A., Approach for Software Realization of Processor for Real Time Control Model of Photometric Systems Complex, Proceedings of International Conference on Computer Systems and Technologies - CompSysTech'2003 Google ScholarDigital Library
- {6}. Wiens, R.H., S. Brown, S. Sargoytchev, R.N. Peterson, W.A. Gault, G.G. Shepherd, A. Moise, T. lvanko, G. Fazekas, SATI - spectral airglow temperature imager, Proc. SPIE, 2830, 341-344, 1996Google ScholarCross Ref
Index Terms
- Control model of photometric complex based on asynchronous finite automaton
Recommendations
The Construction Approach of Regular Expressions from Finite Automata Including Multi-Node Loops
ICCI '06: Proceedings of the 2006 5th IEEE International Conference on Cognitive Informatics - Volume 02The automaton theory has been widely applied in many areas of science, such as system simulations, neural networks, etc. It is also a basic theory of compiling routine for discriminating words of a programming language. This paper analyses the ...
Canonical derivatives, partial derivatives and finite automaton constructions
Let E be a regular expression. Our aim is to establish a theoretical relation between two well-known automata recognizing the language of E, namely the position automaton PE constructed by Glushkov or McNaughton and Yamada, and the equation automaton EE ...
On the Height of a Finite Automaton
The states of a finite automaton are ordered by height. This order is shown to be graduated, and the well-known Cerny problem on the minimal length of reset words can be formulated in terms of global height. The problem is proved for automata with four ...
Comments