Author: Jean-Marc ChamparnaudPublish On: 2003-08-03
7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers Jean-Marc Champarnaud, Denis Maurel ... This paper studies practical algorithms for dealing with a particular family of cellular automata, ...
Author: Jean-Marc Champarnaud
The refereed post-proceedings of the 7th International Conference on Implementation and Application of Automata, CIAA 2002, held in Tours, France, in July 2002. The 28 revised full papers presented together with an invited paper and 4 short papers were carefully selected during two rounds of reviewing and revision. The topics addressed range from theoretical and methodological issues to automata applications in software engineering, natural language processing, speech recognition, and image processing, to new representations and algorithms for efficient implementation of automata and related structures.
The current paper sheds some more light on the relationship between the pebble automata classes. In a nutshell, (a) whether pebbles are strong or not does not change the expressive power but (b) increasing the number of pebbles or ...
Author: Michele Bugliesi
Publisher: Springer Science & Business Media
The two-volume set LNCS 4051 and LNCS 4052 constitutes the refereed proceedings of the 33rd International Colloquium on Automata, Languages and Programming, ICALP 2006, held in Venice, Italy, July 2006. In all, these volumes present more 100 papers and lectures. Volume I (4051) presents 61 revised full papers together with 1 invited lecture, focusing on algorithms, automata, complexity and games, on topics including graph theory, quantum computing, and more.
In the same paper, he also considered generalized acceptance, where the acceptance condition is given by an ω-automaton. What we call Rabin acceptance was first defined by Rabin in . With respect to finite automata on infinite ...
Author: Erich Grädel
A central aim and ever-lasting dream of computer science is to put the development of hardware and software systems on a mathematical basis which is both firm and practical. Such a scientific foundation is needed especially for the construction of reactive programs, like communication protocols or control systems. For the construction and analysis of reactive systems an elegant and powerful theory has been developed based on automata theory, logical systems for the specification of nonterminating behavior, and infinite two-person games. The 19 chapters presented in this multi-author monograph give a consolidated overview of the research results achieved in the theory of automata, logics, and infinite games during the past 10 years. Special emphasis is placed on coherent style, complete coverage of all relevant topics, motivation, examples, justification of constructions, and exercises.
simplified variants of P automata, but without any membrane structure or a mapping facility. This survey paper is primarily based on the research works on reaction automata achieved in [16–18] in which reaction automata are considered ...
Author: Yasuhiro Suzuki
Category: Technology & Engineering
This book highlights recent advances in natural computing, including biology and its theory, bio-inspired computing, computational aesthetics, computational models and theories, computing with natural media, philosophy of natural computing and educational technology. It presents extended versions of the best papers selected from the symposium “7th International Workshop on Natural Computing” (IWNC7), held in Tokyo, Japan, in 2013. The target audience is not limited to researchers working in natural computing but also those active in biological engineering, fine/media art design, aesthetics and philosophy.
The present volume is a collection of papers which deal with various aspects of automata theory. This theory is of interest to scientists in many different fields and, correspondingly, among the authors are workers who are primarily ...
Author: C. E. Shannon
Publisher: Princeton University Press
The description for this book, Automata Studies. (AM-34), Volume 34, will be forthcoming.
In the other hand we give an efficient algorithm to compute position tree automaton. The paper is organized as follows: Section 2 outlines finite tree automata and regular tree expressions. Next the notion of linearized regular tree ...
Author: Adrian-Horia Dediu
This book constitutes the refereed proceedings of the 7th International Conference on Language and Automata Theory and Applications, LATA 2013, held in Bilbao, Spain in April 2013. The 45 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 97 initial submissions. The volume features contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.). Among the topics covered are algebraic language theory; algorithms for semi-structured data mining; algorithms on automata and words; automata and logic; automata for system analysis and program verification; automata, concurrency and Petri nets; automatic structures; cellular automata; combinatorics on words; computability; computational complexity; computational linguistics; data and image compression; decidability questions on words and languages; descriptional complexity; DNA and other models of bio-inspired computing; document engineering; foundations of finite state technology; foundations of XML; fuzzy and rough languages; grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.); grammars and automata architectures; grammatical inference and algorithmic learning; graphs and graph transformation; language varieties and semigroups; language-based cryptography; language-theoretic foundations of artificial intelligence and artificial life; parallel and regulated rewriting; parsing; pattern recognition; patterns and codes; power series; quantum, chemical and optical computing; semantics; string and combinatorial issues in computational biology and bioinformatics; string processing algorithms; symbolic dynamics; symbolic neural networks; term rewriting; transducers; trees, tree languages and tree automata; weighted automata.
Author: University of Michigan. Communication Sciences LaboratoryPublish On: 1959
INTRODUCTION This report contains papers in automata theory , the research for which was supported in whole or in part by the National Science Foundation through Grant GP - 2539 to A. W. Burks and The University of Michigan .
Author: University of Michigan. Communication Sciences Laboratory
There are many papers reported on such automata, the length of synchronizing sequences and the complexity of methods for checking the existence of such sequences (see, for example, ). In this paper, we fill a gap between homing and ...
Author: Frank Drewes
This book constitutes the refereed proceedings of the 20th International Conference on Implementation and Application of Automata, CIAA 2015, held in held in Umeå, Sweden, in August 2015. The 22 revised full papers presented together with 4 invited papers and 2 toool demonstration papers were carefully reviewed and selected from 49 submissions. The papers cover all aspects of cover automata, counter automata, decision algorithms on automata, descriptional complexity, expressive power of automata, homing sequences, jumping finite automata, multi-dimensional languages, parsing and pattern matching, quantum automata, realtime pushdown automata, random generation of automata, regular expressions, security issues, sensors in automata, transducers, transformation of automata, and weighted automata.
Throughout the paper, 'automaton' mostly stands for 'initial automaton'; we make corresponding remarks if not. Further in the paper we mostly consider transducers. Furthermore, throughout the paper we consider only reachable transducers ...
Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008, Revised Papers Carlos Martin-Vide, Friedrich Otto, ... paper we consider deterministic finite automata A = 〈Q,Σ,δ〉 (in short DFA) with the state set Q, ...
Author: Carlos Martin-Vide
This book constitutes the refereed proceedings of the Second International Conference on Language and Automata Theory and Applications, LATA 2008, held in Tarragona, Spain, in March 2008. The 40 revised full papers presented were carefully reviewed and selected from 134 submissions. The papers deal with the various issues related to automata theory and formal languages