Conferences related to Automata

Back to Top

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.


2018 14th International Workshop on Discrete Event Systems (WODES)

The interdisciplinary field of Discrete Event Systems (DES) combines different formalisms, methodologies and tools from control, computer science and operations research. The research activity in this field is driven by the needs of many different applications domains: manufacturing, process control, supervisory systems, software engineering, transportation, and so on. Discrete Event Systems is now a mature field and many interesting applications have been developed. This 14th International Workshop on Discrete Event Systems will be hosted at Hotel Stabiae Sorrento Coast, Sorrento Coast, Italy. It aims to 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 DES theory and applications.


2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)

ASP-DAC 2018 is the 23rd annual international conference on VLSI design automation in Asia and South Pacific regions, one of the most active regions of design and fabrication of silicon chips in the world. The conference aims at providing the Asian and South Pacific CAD/DA and Design community with opportunities of presenting recent advances and with forums for future directions in technologies related to Electronic Design Automation (EDA). The format of the meeting intends to cultivate and promote an instructive and productive interchange of ideas among EDA researchers/developers and system/circuit/device designers. All scientists, engineers, and students who are interested in theoretical and practical aspects of VLSI design and design automation are welcomed to ASP-DAC.


2018 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

Suggested, but not exclusive, topics of interest include: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, formal aspects of program analysis, formal methods, foundations of computability, games and logic, higher-order logic, lambda and combinatory calculi, linear logic, logic in artificial intelligence, logic programming, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, proof theory, real-time systems, reasoning about security and privacy, rewriting, type systems and type theory, and verification.

  • 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

    Suggested, but not exclusive, topics of interest include: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, formal aspects of program analysis, formal methods, foundations of computability, games and logic, higher-order logic, lambda and combinatory calculi, linear logic, logic in artificial intelligence, logic programming, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, proof theory, real-time systems, reasoning about security and privacy, rewriting, type systems and type theory, and verification.

  • 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

    The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic, broadly construed. We invite submissions on topics that fit under that rubric. Suggested, but not exclusive, topics of interest include:automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, formal aspects of program analysis, formal methods, foundations of computability, higher-order logic, lambda and combinatory calculi, linear logic, logic in artificial intelligence, logic programming, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantic

  • 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

    Suggested, but not exclusive, topics of interest include: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, theory of automatic structures, formal aspects of program analysis, formal methods, foundations of computability, higher-order logic, lambda and combinatory calculi, linear logic, logic in artificial intelligence, logic programming, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, proof theory, real-time systems, reasoning about security, rewriting, type systems and type theory, and verification.

  • 2014 29th Annual IEEE/ACM Symposium on Logic in Computer Science (LICS)

    Suggested, but not exclusive, topics of interest include: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, theory of automatic structures, formal aspects of program analysis, formal methods, foundations of computability, higher-order logic, lambda and combinatory calculi, linear logic, logic in artificial intelligence, logic programming, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, proof theory, real-time systems, reasoning about security, rewriting, type systems and type theory, and verification.

  • 2013 Twenty-Eighth Annual IEEE/ACM Symposium on Logic in Computer Science (LICS 2013)

    The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic, broadly construed.

  • 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.

  • 2011 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011)

    LICS is an annual international forum on topics that lie at the intersection of computer science and mathematical logic.

  • 2010 25th Annual IEEE Symposium on Logic in Computer Science (LICS 2010)

    LICS is an annual international forum on topics that lie at the intersection of computer science and mathematical logic.

  • 2009 24th Annual IEEE Symposium on Logic in Computer Science (LICS 2009)

    LICS is an annual international forum on topics that lie at the intersection of computer science and mathematical logic.

  • 2008 23rd Annual IEEE Symposium on Logic in Computer Science (LICS 2008)

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

  • 2007 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)

  • 2006 21st Annual IEEE Symposium on Logic in Computer Science (LICS 2006)

  • 2005 20th Annual IEEE Symposium on Logic in Computer Science (LICS 2005)


2018 40th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

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


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

[{u'author_order': 1, u'full_name': u'Jing Dong'}, {u'author_order': 2, u'full_name': u'Wenbing Jin'}] 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 ...


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

[{u'author_order': 1, u'affiliation': u'University college of Rouzbahan, Sari, Iran', u'full_name': u'Atefe Aghaei'}] 2018 Second International Conference on Computing Methodologies and Communication (ICCMC), 2018

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 ...


Algorithm of Learning Weighted Automata

[{u'author_order': 1, u'full_name': u'Han Hui'}] 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

[{u'author_order': 1, u'full_name': u'Chenguang Luo'}] 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 ...


Simulating Population Protocols by Gellular Automata

[{u'author_order': 1, u'affiliation': u'University of Tokyo, Department of Computer Science, Tokyo, Japan', u'full_name': u'Tatsuya Yamashita'}, {u'author_order': 2, u'affiliation': u'University of Tokyo, Department of Computer Science, Tokyo, Japan', u'full_name': u'Masami Hagiya'}] 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

eLearning

No eLearning Articles are currently tagged "Automata"

IEEE-USA E-Books

  • The Theory of Timed I/O Automata, Second Edition

    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 algorithms 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 framework 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

  • Cellular automata

    This chapter contains sections titled: Basic concepts, Animate-by-numbers, Cellular automata machines, Historical notes and references

  • 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

  • Physical modeling

    None

  • Overview

    None

  • Resources

    None

  • Conclusions

    None

  • Back Matter

    None

  • Processing of Knowledge about Automata

    This chapter contains sections titled: * Formulation of a Language Information Theory * Extracting and Storing the Meaning of Sentences by Computer * Knowledge Association * Deductive Processes * Inferences * Exercises

  • Appendix B: Analysis for an Effective Operation of a General System of Interactive Automata

    No abstract.



Standards related to Automata

Back to Top

No standards are currently tagged "Automata"


Jobs related to Automata

Back to Top