Conferences related to Automata

Back to Top

2013 IEEE Symposium on Industrial Electronics & Applications (ISIEA)

The symposium covers the areas of industrial electronics and industrial applications in general, that include areas of electronics engineering and its applications, computer engineering and applications, processing, mechatronics, instrumentation, measurement, and their applications in the humanities & commercial

  • 2012 IEEE Symposium on Industrial Electronics and Applications (ISIEA 2012)

    This annual symposium is to bring together scientists, engineers and postgraduates who work in these fields; to share their ideas and experience. Papers are solicited on recent research results, new developments and technology trends in the field of power electronics, industrial electronics, industrial applications, life-science applications, computer & network applications, measurement systems, business applications and ocean applications related technology.

  • 2011 IEEE Symposium on Industrial Electronics and Applications (ISIEA 2011)

    This annual symposium is to bring together scientists, engineers and postgraduates who work in these fields; to share their ideas and experience. Papers are solicited on recent research results, new developments and technology trends in the field of power electronics, industrial electronics, industrial applications, life-science applications, computer & network applications, measurement systems, business applications and ocean applications related technology.

  • 2010 IEEE Symposium on Industrial Electronics and Applications (ISIEA 2010)

    This annual symposium is to bring together scientists, engineers and postgraduates who work in these fields; to share their ideas and experience. Papers are solicited on recent research results, new developments and technology trends in the field of power electronics, industrial electronics, industrial applications, life-science applications, computer & network applications, measurement systems, business applications and ocean applications related technology.

  • 2009 IEEE Symposium on Industrial Electronics and Applications (ISIEA 2009)

    This annual symposium is to bring together scientists, engineers and postgraduates who work in these fields to share their ideas and experience. Papers are solicited on recent research results, new developments and technology trends in the field of power electronics, industrial electronics, industrial applications, life-science applications and measurement systems.


2012 11th International Workshop on Discrete Event Systems - WODES

Discrete event systems theory and applications.

  • 2008 9th International Workshop on Discrete Event Systems - WODES

    The workshop will provide researchers from different fields (control theoreticians and control engineers, software engineers and computer scientists, operations research specialists) with an opportunity to exchange information and new ideas, and to discuss new developments in the field of Discrete Event Systems theory and application.


2012 27th Annual IEEE Symposium on Logic in Computer Science (LICS 2012)

The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic in a broad sense.


2008 9th International Conference for Young Computer Scientists (ICYCS)

Following the tradition and success of previous ICYCS conferences, ICYCS 2008 will provide an international forum for scientists and engineers in academia and industry to exchange and discuss their experiences, new ideas, research results, and applications on all aspects of Computer Science and Technology and its related disciplines. It will feature keynote speeches, technical presentations, panel discussions and symposiums/workshops .



Periodicals related to Automata

Back to Top

Evolutionary Computation, IEEE Transactions on

Papers on application, design, and theory of evolutionary computation, with emphasis given to engineering systems and scientific applications. Evolutionary optimization, machine learning, intelligent systems design, image processing and machine vision, pattern recognition, evolutionary neurocomputing, evolutionary fuzzy systems, applications in biomedicine and biochemistry, robotics and control, mathematical modelling, civil, chemical, aeronautical, and industrial engineering applications.


Software Engineering, IEEE Transactions on

Specification, development, management, test, maintenance, and documentation of computer software.


Systems, Man, and Cybernetics, Part B, IEEE Transactions on

The scope of the IEEE Transactions on Systems, Man and Cybernetics Part B: Cybernetics includes computational approaches to the field of cybernetics. Specifically, the transactions welcomes papers on communication and control across machines or between machines, humans, and organizations. The scope of Part B includes such areas as computational intelligence, computer vision, neural networks, genetic algorithms, machine learning, fuzzy systems, ...




Xplore Articles related to Automata

Back to Top

Verticalization Of Direct Structural Table In Synthesis Of Mealy FSMS For FPGAs

A. Bukowiec; A. Barkalov Proceedings of the International Conference Mixed Design of Integrated Circuits and System, 2006. MIXDES 2006., 2006

The method of decreasing of amount of logic in FPGA device that implements the logic circuit of finite state machine (FSM) with Mealy outputs is proposed. Method is based on verticalization of microinstructions in direct structural table (DST). As a result of verticalization all microoperations of direct structural table are compatible ones. It permits to encode each microoperation by code ...


Two-pass search strategy for large list recognition on embedded speech recognition platforms

M. Novak; R. Hampl; P. Krbec; V. Bergl; J. Sedivy Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03). 2003 IEEE International Conference on, 2003

This paper presents an efficient algorithm for a speech recognition system which can process large lists of items. The described two-pass search implementation focuses on maximizing the speed and minimizing the memory footprint of the search engine. The algorithm is designed to handle thousands or tens of thousands of words in a search space restricted by a grammar. A typical ...


Design of an Efficient Scheme for Data Migration in Chip-Multiprocessors

Baisakhi Das; Nirmalya Sundar Maiti; Sukanta Das; Mousumi Saha; Biplab K. Sikdar 2013 International Symposium on Electronic System Design, 2013

Chip Multiprocessors (CMPs) with non-uniform cache architecture (NUCA) realizes thousands of processor cores on-chip. This work proposes an efficient scheme for data migration in CMPs, during program execution, for exploiting benefits of such design with NUCA. The scheme is developed around the modelling tool of periodic boundary cellular automata (CA). The CA employed performs density classification of the instances of ...


Deep Sparse Coding for Non-Intrusive Load Monitoring

Shikha Singh; Angshul Majumdar IEEE Transactions on Smart Grid, 2017

Energy disaggregation is the task of segregating the aggregate energy of the entire building (as logged by the smartmeter) into the energy consumed by individual appliances. This is a single channel (the only channel being the smart-meter) blind source (different electrical appliances) separation problem. The traditional way to address this is via stochastic finite state machines (e.g. Factorial Hidden Markov ...


An integrated approach to modeling and analysis of embedded real-time systems based on Timed Petri Nets

Zonghua Gu; K. G. Shin 23rd International Conference on Distributed Computing Systems, 2003. Proceedings., 2003

In computer-based control systems, embedded software is taking over what mechanical and dedicated electronic systems used to do, that is, to engage and control the physical world, interacting directly with sensors and actuators. Therefore, software running on a digital processor is tightly-coupled with its surrounding physical environment. We propose an integrated approach based on Timed Petri-Nets for modeling and analysis ...


More Xplore Articles

Educational Resources on Automata

Back to Top

eLearning

Verticalization Of Direct Structural Table In Synthesis Of Mealy FSMS For FPGAs

A. Bukowiec; A. Barkalov Proceedings of the International Conference Mixed Design of Integrated Circuits and System, 2006. MIXDES 2006., 2006

The method of decreasing of amount of logic in FPGA device that implements the logic circuit of finite state machine (FSM) with Mealy outputs is proposed. Method is based on verticalization of microinstructions in direct structural table (DST). As a result of verticalization all microoperations of direct structural table are compatible ones. It permits to encode each microoperation by code ...


Two-pass search strategy for large list recognition on embedded speech recognition platforms

M. Novak; R. Hampl; P. Krbec; V. Bergl; J. Sedivy Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03). 2003 IEEE International Conference on, 2003

This paper presents an efficient algorithm for a speech recognition system which can process large lists of items. The described two-pass search implementation focuses on maximizing the speed and minimizing the memory footprint of the search engine. The algorithm is designed to handle thousands or tens of thousands of words in a search space restricted by a grammar. A typical ...


Design of an Efficient Scheme for Data Migration in Chip-Multiprocessors

Baisakhi Das; Nirmalya Sundar Maiti; Sukanta Das; Mousumi Saha; Biplab K. Sikdar 2013 International Symposium on Electronic System Design, 2013

Chip Multiprocessors (CMPs) with non-uniform cache architecture (NUCA) realizes thousands of processor cores on-chip. This work proposes an efficient scheme for data migration in CMPs, during program execution, for exploiting benefits of such design with NUCA. The scheme is developed around the modelling tool of periodic boundary cellular automata (CA). The CA employed performs density classification of the instances of ...


Deep Sparse Coding for Non-Intrusive Load Monitoring

Shikha Singh; Angshul Majumdar IEEE Transactions on Smart Grid, 2017

Energy disaggregation is the task of segregating the aggregate energy of the entire building (as logged by the smartmeter) into the energy consumed by individual appliances. This is a single channel (the only channel being the smart-meter) blind source (different electrical appliances) separation problem. The traditional way to address this is via stochastic finite state machines (e.g. Factorial Hidden Markov ...


An integrated approach to modeling and analysis of embedded real-time systems based on Timed Petri Nets

Zonghua Gu; K. G. Shin 23rd International Conference on Distributed Computing Systems, 2003. Proceedings., 2003

In computer-based control systems, embedded software is taking over what mechanical and dedicated electronic systems used to do, that is, to engage and control the physical world, interacting directly with sensors and actuators. Therefore, software running on a digital processor is tightly-coupled with its surrounding physical environment. We propose an integrated approach based on Timed Petri-Nets for modeling and analysis ...


More eLearning Resources

IEEE-USA E-Books

  • Evolving Memory: Logical Tasks for Cellular Automata

    We present novel experiments in the evolution of Cellular Automata (CA) to solve nontrivial tasks. Using a genetic algorithm, we evolved CA rules that can solve non-trivial logical tasks related to the density task (or majority classification problem) commonly used in the literature. We present the particle catalogs of the new rules following the computational mechanics framework. We know from Crutchfield et al (2002) that particle computation in CA is a process of information processing and integration. Here, we discuss the type of memory that emerges from the evolving CA experiments for storing and manipulating information. In particular, we contrast this type of evolved memory with the type of memory we are familiar with in Computer Science, and also with the type of biological memory instantiated by DNA. A novel CA rule obtained from our own experiments is used to elucidate the type of memory that one-dimensional CA can attain.

  • Computers and AutomataDecimal classification: 621.385.2. Original manuscript received by the Institute, July 17, 1953.

    This paper reviews briefly some of the recent developments in the field of automata and nonnumerical computation. A number of typical machines are described, including logic machines, game-playing machines and learning machines. Some theoretical questions and developments are discussed, such as a comparison of computers and the brain, Turing's formulation of computing machines and von Neumann's models of self-reproducing machines.

  • Index

    This monograph is an attempt to develop further and refine methods based on input -output descriptions for analyzing feedback systems. Contrary to previous work in this area, the treatment heavily emphasizes and exploits the causality of the operators involved. This brings the work into closer contact with the theory of dynamical systems and automata.

  • No title

    This monograph presents the Timed Input/Output Automaton (TIOA) modeling framework, a basic mathematical framework to support description and analysis of timed (computing) systems. Timed systems are systems in which desirable correctness or performance properties of the system depend on the timing of events, not just on the order of their occurrence. Timed systems are employed in a wide range of domains including communications, embedded systems, real- time operating systems, and automated control. Many applications involving timed systems have strong safety, reliability, and predictability requirements, which make it important to have methods for systematic design of systems and rigorous analysis of timing-dependent behavior. The TIOA framework also supports description and analysis of timed distributed algorithms -- distributed algorithms whose correctness and performance depend on the relative speeds of processors, accuracy of local clocks, or communication delay bounds. Such algori hms arise, for example, in traditional and wireless communications, networks of mobile devices, and shared-memory multiprocessors. The need to prove rigorous theoretical results about timed distributed algorithms makes it important to have a suitable mathematical foundation. An important feature of the TIOA framework is its support for decomposing timed system descriptions. In particular, the framework includes a notion of external behavior for a timed I/O automaton, which captures its discrete interactions with its environment. The framework also defines what it means for one TIOA to implement another, based on an inclusion relationship between their external behavior sets, and defines notions of simulations, which provide sufficient conditions for demonstrating implementation relationships. The framework includes a composition operation for TIOAs, which respects external behavior, and a notion of receptiveness, which implies that a TIOA does not block the passage of time. The TIOA f amework also defines the notion of a property and what it means for a property to be a safety or a liveness property. It includes results that capture common proof methods for showing that automata satisfy properties. Table of Contents: Introduction / Mathematical Preliminaries / Describing Timed System Behavior / Timed Automata / Operations on Timed Automata / Properties for Timed Automata / Timed I/O Automata / Operations on Timed I/O Automata / Conclusions and Future Work

  • Representation of Discrete States

    This chapter contains sections titled: Introduction Finite-State Automata Neural Network Representations of DFA Pushdown Automata Turing Machines Conclusion

  • Complex Genetic Evolution of Self-Replicating Loops

    lt is generally believed that self-replication models constructed on cellular automata have quite limited evolutionary dynamics in both diversity and adaptative behavior. Contrary to this view, we show that complex genetic diversification and adaptation processes may occur in self-replicating loop populations. Applying newly developed tools for detailed genetic identification and genealogy tracing to evoloop populations, we uncovered a genotypic permutation space that expands combinatorially with replicator size. Within this space populations demonstrate broad behavioral diversity and non- trivial genetic adaptation, maximizing colony density while enhancing sustainability against other species. We also found a set of non-mutable subsequences enabling genetic operations that alter fitness differentials and promote long-term evolutionary exploration. These results reveal the amazing potential of cellular automata to re-create complex genetic evolution of selfreplicators in a simple, deterministic framework.

  • Processing Knowledge About Systems of Automata

    This chapter contains sections titled: A General System of Interactive Automata: Detailed Analysis Knowledge Structures for Sentences Describing Systems of Interactive Automata Exercises

  • No title

    This book is concerned with the models of quantum computation. Information processing based on the rules of quantum mechanics provides us with new opportunities for developing more efficient algorithms and protocols. However, to harness the power offered by quantum information processing it is essential to control the behavior of quantum mechanical objects in a precise manner. As this seems to be conceptually difficult at the level of quantum states and unitary gates, high-level quantum programming languages have been proposed for this purpose. The aim of this book is to provide an introduction to abstract models of computation used in quantum information theory. Starting from the abstract models of Turing machine and finite automata, we introduce the models of Boolean circuits and Random Access Machine and use them to present quantum programming techniques and quantum programming languages. Table of Contents: Introduction / Turing machines / Quantum Finite State Automata / Computatio al Circuits / Random Access Machines / Quantum Programming Environment / Quantum Programming Languages / Imperative quantum programming / Functional Quantum Programming / Outlook

  • Second-order dynamics

    This chapter contains sections titled: Firing of neurons: a three-state rule, Going into reverse gear, An impenetrable shield, Other examples

  • A situated view of representation and control

    Intelligent agents are systems that have a complex, ongoing interaction with an environment that is dynamic and imperfectly predictable. Agents are typically difficult to program because the correctness of a program depends on the details of how the agent is situated in its environment. In this paper, we present a methodology for the design of situated agents that is based on situated-automata theory. This approach allows designers to describe the informational content of an agent's computational states in a semantically rigorous way without requiring a commitment to conventional run-time symbolic processing. We start by outlining this situated view of representation, then show how it contributes to design methodologies for building systems that track perceptual conditions and take purposeful actions in their environments.



Standards related to Automata

Back to Top

No standards are currently tagged "Automata"


Jobs related to Automata

Back to Top