Conferences related to Automata

Back to Top

2019 41st Annual International Conference of the IEEE Engineering in Medicine & Biology Society (EMBC)

The conference program will consist of plenary lectures, symposia, workshops andinvitedsessions of the latest significant findings and developments in all the major fields ofbiomedical engineering.Submitted papers will be peer reviewed. Accepted high quality paperswill be presented in oral and postersessions, will appear in the Conference Proceedings and willbe indexed in PubMed/MEDLINE & IEEE Xplore


2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)

The conference is the primary forum for cross-industry and multidisciplinary research in automation. Its goal is to provide a broad coverage and dissemination of foundational research in automation among researchers, academics, and practitioners.


2019 IEEE 17th International Conference on Industrial Informatics (INDIN)

Industrial information technologies


2019 IEEE 58th Conference on Decision and Control (CDC)

The CDC is recognized as the premier scientific and engineering conference dedicated to the advancement of the theory and practice of systems and control. The CDC annually brings together an international community of researchers and practitioners in the field of automatic control to discuss new research results, perspectives on future developments, and innovative applications relevant to decision making, systems and control, and related areas.The 58th CDC will feature contributed and invited papers, as well as workshops and may include tutorial sessions.The IEEE CDC is hosted by the IEEE Control Systems Society (CSS) in cooperation with the Society for Industrial and Applied Mathematics (SIAM), the Institute for Operations Research and the Management Sciences (INFORMS), the Japanese Society for Instrument and Control Engineers (SICE), and the European Union Control Association (EUCA).


2019 IEEE SENSORS

The IEEE Sensors Conference is a forum for presentation, discussion, and exchange of state-of-the art information including the latest research and development in sensors and their related fields. It brings together researchers, developers, and practitioners from diverse fields including international scientists and engineers from academia, research institutes, and companies to present and discuss the latest results in the general field of sensors.

  • 2018 IEEE SENSORS

    The IEEE Sensors Conference is a forum for presentation, discussion, and exchange of state -of-the art information including the latest research and development in sensors and their relatedfields. It brings together researchers, developers, and practitioners from diverse fields includinginternational scientists and engineers from academia, research institutes, and companies topresent and discuss the latest results in the general field of sensors.

  • 2017 IEEE SENSORS

    The IEEE Sensors Conference is a forum for presentation, discussion, and exchange of state -of-the art information including the latest research and development in sensors and their relatedfields. It brings together researchers, developers, and practitioners from diverse fields includinginternational scientists and engineers from academia, research institutes, and companies topresent and discuss the latest results in the general field of sensors.

  • 2016 IEEE Sensors

    The IEEE Sensors Conference is a forum for presentation, discussion, and exchange of state -of-the art information including the latest research and development in sensors and their related fields. It brings together researchers, developers, and practitioners from diverse fields including international scientists and engineers from academia, research institutes, and companies to present and discuss the latest results in the general field of sensors.

  • 2015 IEEE Sensors

    The IEEE Sensors Conference is a forum for presentation, discussion, and exchange of state -of-the art information including the latest research and development in sensors and their related fields. It brings together researchers, developers, and practitioners from diverse fieldsincluding international scientists and engineers from academia, research institutes, and companies topresent and discuss the latest results in the general field of sensors.

  • 2014 IEEE Sensors

    The IEEE Sensors Conference is a forum for presentation, discussion, andexchange of state -of-the art information including the latest research and development in sensors andtheir related fields. It brings together researchers, developers, and practitioners from diverse fieldsincluding international scientists and engineers from academia, research institutes, and companies topresent and discuss the latest results in the general field of sensors.

  • 2013 IEEE Sensors

    The IEEE SENSORS Conference is a forum for presentation, discussion, and exchange of state -of-the art information including the latest research and development in sensors and their related fields. It brings together researchers, developers, and practitioners from diverse fields including international scientists and engineers from academia, research institutes, and companies to present and discuss the latest results in the general field of sensors.

  • 2012 IEEE Sensors

    The IEEE Sensors Conference is a forum for presentation, discussion, and exchange of state-of-the art information including the latest research and development in sensors and their related fields. It brings together researchers, developers, and practitioners from diverse fields including international scientists and engineers from academia, research institutes, and companies to present and discuss the latest results in the general field of sensors.

  • 2011 IEEE Sensors

    The IEEE Sensors Conference is a forum for presentation, discussion, and exchange of state-of-the art information including the latest research and development in sensors and their related fields. It brings together researchers, developers, and practitioners from diverse fields including international scientists and engineers from academia, research institutes, and companies to present and discuss the latest results in the general field of sensors. IEEE SENSORS 2011 will include keynote addresses by eminen

  • 2010 IEEE Sensors

    The IEEE SENSORS 2010 Conference is a forum for state-of-the-art presentations on sensors and related topics covering from theory to application, device to system, modeling to implementation and from macro/nano to scale.

  • 2009 IEEE Sensors

    IEEE Sensors Conference 2009 is intended to provide a common forum for researchers, scientists, engineers and practitioners throughout the world to present their latest research findings, ideas, developments and applications in the area of sensors and sensing technology. IEEE Sensors Conference 2009 will include keynote addresses by eminent scientists as well as special, regular and poster sessions.

  • 2008 IEEE Sensors

    IEEE SENSORS 2008 solicits original and state-of-the-art contributions to sensors and related topics, covering from theory to application, from device to system, from modeling to implementation, and from macro to micro/nano in scale. Topics of interest include,but are not limitid to: Phenomena, Modeling, and Evaluation (Novel Sensing Principles, Theory and Modeling, Sensors Characterization, Evaluation and Testing, Data Handling and Mining) Chemical and Gas Sensors (Materials, Devices, Electronics N

  • 2007 IEEE Sensors

    IEEE SENSORS 2007 solicits original and state-of-the-art contributions to sensors and related topics, covering from theory to application, from device to system, from modeling to implementation, and from macro to micro/nano in scale.

  • 2006 IEEE Sensors

  • 2005 IEEE Sensors

  • 2004 IEEE Sensors

  • 2003 IEEE Sensors

  • 2002 IEEE Sensors


More Conferences

Periodicals related to Automata

Back to Top

Automatic Control, IEEE Transactions on

The theory, design and application of Control Systems. It shall encompass components, and the integration of these components, as are necessary for the construction of such systems. The word `systems' as used herein shall be interpreted to include physical, biological, organizational and other entities and combinations thereof, which can be represented through a mathematical symbolism. The Field of Interest: shall ...


Automation Science and Engineering, IEEE Transactions on

The IEEE Transactions on Automation Sciences and Engineering (T-ASE) publishes fundamental papers on Automation, emphasizing scientific results that advance efficiency, quality, productivity, and reliability. T-ASE encourages interdisciplinary approaches from computer science, control systems, electrical engineering, mathematics, mechanical engineering, operations research, and other fields. We welcome results relevant to industries such as agriculture, biotechnology, healthcare, home automation, maintenance, manufacturing, pharmaceuticals, retail, ...


Circuits and Systems I: Regular Papers, IEEE Transactions on

Part I will now contain regular papers focusing on all matters related to fundamental theory, applications, analog and digital signal processing. Part II will report on the latest significant results across all of these topic areas.


Circuits and Systems II: Express Briefs, IEEE Transactions on

Part I will now contain regular papers focusing on all matters related to fundamental theory, applications, analog and digital signal processing. Part II will report on the latest significant results across all of these topic areas.


Communications Letters, IEEE

Covers topics in the scope of IEEE Transactions on Communications but in the form of very brief publication (maximum of 6column lengths, including all diagrams and tables.)


More Periodicals

Most published Xplore authors for Automata

Back to Top

Xplore Articles related to Automata

Back to Top

Comparison of Two-Way Two-Dimensional Finite Automata and Three-Way Two-Dimensional Finite Automata

2012 International Conference on Computer Science and Service System, 2012

Three types of two-way two-dimensional finite automata and three-way two- dimensional finite automata are studied, including deterministic, nondeterministic and Las Vegas finite automata. By comparing the languages recognized by above automata, two results are obtained: (1) The power of two- way two-dimensional nondeterministic finite automata and three-way two- dimensional deterministic finite automata cannot be compared, (2) The power of two-way ...


Algorithm of Learning Weighted Automata

2013 International Conference on Computational and Information Sciences, 2013

Weighted automata is a quantitative formalism of finite automata, where for each transition there adheres a weight, and the domain of all weights is a Semiring. The existing learning algorithms for weighted automata assume the domain of weights being a Field. In this paper, we prove the learnability of weighted automata from Field to LC - Semiring, a special case ...


From Word Automata to Tree Automata

2008 The 9th International Conference for Young Computer Scientists, 2008

Finite tree automata have now become a live research field both because of its features as a theoretical model of computation and its practical value in the parsing, query and verification of semi-structured data, such as XML. The aim of this work is to create a link between the already well-developed finite state automata over words and the finite automata ...


Cellular Automata learning algorithm for classification

2014 International Electrical Engineering Congress (iEECON), 2014

Cellular Automata (CA) were proved as universal computation model. This means that CA are capable of modeling any problems to arrive at the solutions. Since then, researchers have paid efforts to seek the possible classifiers being constructed on this model. However, there is a number of papers to date haing reported classification with limited applications using cellular automata. This paper ...


Simulating Population Protocols by Gellular Automata

2018 57th Annual Conference of the Society of Instrument and Control Engineers of Japan (SICE), 2018

In our previous research, we studied the computational universality of gellular automata, a variant of asynchronous cellular automata that are intended to be realized by a reaction-diffusion system in a gel material. In this paper, we characterize the computational power of gellular automata as a model of distributed computations by presenting gellular automata that simulate a population protocol on an ...


More Xplore Articles

Educational Resources on Automata

Back to Top

IEEE-USA E-Books

  • Comparison of Two-Way Two-Dimensional Finite Automata and Three-Way Two-Dimensional Finite Automata

    Three types of two-way two-dimensional finite automata and three-way two- dimensional finite automata are studied, including deterministic, nondeterministic and Las Vegas finite automata. By comparing the languages recognized by above automata, two results are obtained: (1) The power of two- way two-dimensional nondeterministic finite automata and three-way two- dimensional deterministic finite automata cannot be compared, (2) The power of two-way two-dimensional nondeterministic finite automata and three-way two- dimensional Las Vegas finite automata cannot be compared.

  • Algorithm of Learning Weighted Automata

    Weighted automata is a quantitative formalism of finite automata, where for each transition there adheres a weight, and the domain of all weights is a Semiring. The existing learning algorithms for weighted automata assume the domain of weights being a Field. In this paper, we prove the learnability of weighted automata from Field to LC - Semiring, a special case of Semiring satisfying the linear combination property. A new algorithm based on the exact learning model is proposed. The experimental results on a collection of examples confirm that the space advantage of our learning algorithm for deterministic and weighted automata.

  • From Word Automata to Tree Automata

    Finite tree automata have now become a live research field both because of its features as a theoretical model of computation and its practical value in the parsing, query and verification of semi-structured data, such as XML. The aim of this work is to create a link between the already well-developed finite state automata over words and the finite automata over trees, by adding the mechanism of "invocation-and-return'' to a group of finite word automata. In this paper, the definition of this link and the resulted computation model, recursive tree automata, are formalized based on former works. Then we present an analysis for its expressiveness, closure properties and decision problems, to show that a group of finite word automata armed with this link has identical power of a tree automata. Also some applications of this link are introduced, involving a means of formalization of the W3C XML Schema.

  • Cellular Automata learning algorithm for classification

    Cellular Automata (CA) were proved as universal computation model. This means that CA are capable of modeling any problems to arrive at the solutions. Since then, researchers have paid efforts to seek the possible classifiers being constructed on this model. However, there is a number of papers to date haing reported classification with limited applications using cellular automata. This paper presents a novel state of the art classification model on the basis of cellular automata. The proposed classifier was developed on the proposed Decision Support Elementary Cellular Automata (DS-ECA). It comprises double rule vectors and a decision function. Its structure comprises two layers; the first layer is employed to evolve an input pattern into feature space and the other then interprets the feature space to binary answer through the decision function. For performance evaluation, six datasets consisting of binary and non-binary features are implemented in comparison with Support Vector Machines (SVM) with the optimal kernel using k-fold cross validation. In this respect, the proposed method outperforms SVM for binary featured datasets, and reports equivalent and better results on average for non-binary features.

  • Simulating Population Protocols by Gellular Automata

    In our previous research, we studied the computational universality of gellular automata, a variant of asynchronous cellular automata that are intended to be realized by a reaction-diffusion system in a gel material. In this paper, we characterize the computational power of gellular automata as a model of distributed computations by presenting gellular automata that simulate a population protocol on an undirected graph. We also show that such gellular automata can be embedded into a lattice space if the interaction graph of the population protocol is planar. These results demonstrate the versatility of gellular automata as a model of distributed computations.

  • Image cellular automata coding based on resolution progressive experiments with color spaces and file formats

    Scalability or Progressive is a method used to reduce the quality used in Image Compression. There are several types of scalability: Quality, Resolution and Component. Each type is considered and calculated differently depending on purpose. In this research, we consider aspects of Resolution Progressive. Currently, the methods commonly used for this image encoding include Wavelet and Laplacian Pyramids. The objective is to maximize the quality of information that is encoded and to display the results in multiple resolutions. This paper presents an encoding method consisting of Reversible Cellular Automata and Intra-prediction. Reversible Cellular Automata methods are used for data conversion to adjust the resolution and Intra-prediction is applied to reduce redundant data that is to be compressed. Necessary experiments with color images are used to test the stability of the data after saving various image formats such as BMP and JPEG using the PSNR and SSIM performance measures. In this regard, the proposed method experiments with RGB color and BMP formats which provide more results than the other color space and file formats.

  • Adaptive Edge Detection via Image Statistic Features and Hybrid Model of Fuzzy Cellular Automata and Cellular Learning Automata

    In this paper a new approach for adaptive edge detection via image statistic features and hybrid model of fuzzy cellular automata and cellular learning automata is presented. Edge detection in image is one of the basic and most significant operations in image processing that edge detection have a lot of application in image processing. Presented method in first stage used of statistic feature of its image for primary edge detection, that cause adaptively for this method at all internal image. At the second stage fuzzy cellular automata and cellular learning automata are used for edges amplify and castrate these aren't edge. The result obtained from implementation shows That the performance of this method is much better compared to other edge detection methods.

  • Schedulability Analysis for Distributed Systems Using Network of Action Automata and Environment Automata

    Recently, several formal approaches have been presented to address the problem of schedulability analysis of real-time systems by some varieties of timed automata, e.g., UPPAAL and TIMES. In this paper, we consider a more general and complicated formal computational model for distributed systems. To analyze the schedulability of tasks within this model by automata theory, we present a model, action automata, which is a class of suspension automata, to describe the execution semantics of tasks, we also define an environment model, environment automata, to describe the arrival patterns of tasks. One main result gives the scheduling policies under which the schedulability can be analyzed by our method correctly. To achieve this result, we translate the schedulability analysis to the reach ability analysis of the network of action automata and environment automata. Therefore, another main result of this paper is that we prove the reach ability of action automata is decidable. Based on these conclusions, we implement a prototype tool for schedulability analysis and test its performance under EDF policy.

  • Push down automata vs quantum push down automata

    An automaton is a simple model of computer. There are various automata each with its formal definition. Generally an automaton has some form of input, some form of output, internal states may or may not have some form of storage, hardwired not programmable. In this paper we have discussed about Pushdown Automata, Quantum Pushdown Automata by taking some interesting examples. Then the classical Pushdown Automata are compared with Quantum pushdown automata. Our main objective is to know and understand the language recognized by Quantum pushdown automata.

  • A cellular Automata approach for noisy images edge detection under null boundary conditions

    Cellular automata (CA) refer to a simple and conventional method which performs parallel processing, thereby exhibiting better performance than serial processing in certain contexts, particularly in terms of reduced time complexity. Edge detection is widely used in image processing and numerous methods have been proposed for this purpose. However, most of existing methods are serial techniques and fail to take into consideration noise content of the image. In this paper, an edge detection technique was proposed for noisy images based on a four-neighborhood under Null boundary cellular automata (FNNBCA) for noise elimination and a two-dimensional twenty-five neighborhoods under Null Boundary cellular automata (TFNNBCA) for edge detection. This method considers linear CA rules under null boundary conditions only. Efficiency of the proposed method was further compared to those of existing methods, indicating much promising performance of the proposed method for binary images, so that all edges were well detected even on complex images. Finally, results of implementing the method in MATLAB are presented.



Standards related to Automata

Back to Top

No standards are currently tagged "Automata"


Jobs related to Automata

Back to Top