A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
A notion of timed action transducer is here de ned as an automata-theoretic way o f representing operations on timed automata. ... It is shown that two timed trace inclusion relations are substitutive with respect to operations that can be described by timed action transducers. ... Acknowledgements Roberto Segala pointed out to us the importance of making an in nite number of copies of the second argument in the transducer for Kleene's star operator. ...doi:10.1007/bf01211907 fatcat:tthzzqn53rex5eivaheoc4xhz4
A notion of timed action transducer is here de ned as an automata-theoretic way o f representing operations on timed automata. ... It is shown that two timed trace inclusion relations are substitutive with respect to operations that can be described by timed action transducers. ... Acknowledgements Roberto Segala pointed out to us the importance of making an in nite number of copies of the second argument in the transducer for Kleene's star operator. ...doi:10.1007/bfb0084808 dblp:conf/concur/VaandragerL92 fatcat:tvo67m6irzedplnnmw66znhg6u
Two types of head automata are defined: relational head automata suitable for translation by transfer of dependency trees, and head transducers suitable for direct recursive lexical translation. ... This paper presents statistical language and translation models based on collections of small finite state machines we call "head automata". ... Specifically, the possible actions of a transducer M in probabilistic derivations of the dependents of w and v are as follows: Stop: if in state q, transducer M can stop with probability P(stopjM;q), at ...arXiv:cmp-lg/9607006v1 fatcat:jqkatsr5mfgtppwyb6tr6ccudu
Lecture Notes in Computer Science
The main idea is to place a transducer in between the I/O automata teacher and the Mealy machine learner, which translates concepts from the world of I/O automata to the world of Mealy machines, and vice ... Links are established between three widely used modeling frameworks for reactive systems: the ioco theory of Tretmans, the interface automata of De Alfaro and Henzinger, and Mealy machines. ... Acknowledgement Many thanks to Bengt Jonsson, Bernhard Steffen, Jan Tretmans and the anonymous referees for inspiring discussions and/or pointers to the literature, and to Falk Howar for his generous LearnLib ...doi:10.1007/978-3-642-15375-4_6 fatcat:weiewer6pfakdjopsamwqxpaiq
At receiving a piece of data a program performs a sequence of actions (response) and displays the current result. ... Basic actions performed by these programs may be regarded as generating elements of a certain semigroup. ... Introduction Finite state transducers extend the finite state automata to model functions and relations on strings or lists. ...dblp:conf/csp/KozlovaZ16 fatcat:rbbbo6vudbah7g2txufb3j35rq
One is a transfer model with monolingual head automata for analysis and generation; the other is a direct transduction model based on bilingual head transducers. ... We conclude that the head transducer model is more effective according to measures of accuracy, computational requirements, model size, and development effort. ... Acknowledgment We are grateful to Jishen He for building the Chinese model and bilingual lexicon of the earlier transfer system that we used in this work for comparison with the head transducer system. ...doi:10.3115/976909.979663 dblp:conf/acl/AlshawiBX97 fatcat:65dazm2czrh7rc4xnqwhzxk5eu
TAGS allows to simulate both Moore and Mealy transducer automata, integrating different theoretical concepts associated with them. ... This paper introduces TAGS (Transducer Automata Graphical Simulator), a software tool for teaching different aspects of transducer automata theory, a theoretical topic which underlies many aspects of the ... In our opinion, the theory and application of transducer automata are very interesting topics for many students. ...doi:10.7227/ijeee.42.4.5 fatcat:k4bcskhcifcafejf5b42s4n6ne
, and whether a ÿnite transducer realizes a sequential relation. ... We describe here a construction on transducers that give a new conceptual proof for two classical decidability results on transducers: it is decidable whether a ÿnite transducer realizes a functional relation ... Using classical algorithms from automata theory, any transducer T can be transformed into an equivalent transducer that is real-time [10, Theorem IX.5.1; 3, Proposition III.7.1]. ...doi:10.1016/s0304-3975(01)00214-6 fatcat:uwlxhfohtrfm5dkod7uf5k6byu
and a variant of streaming string transducers for data words. ... Our starting point are register automata for data words, in the style of Kaminski and Francez. ... Every time it sees an atom value, it stores the value in the register and every time it sees ↓, and the register is non-empty, the machine outputs the register's content. ...doi:10.4230/lipics.icalp.2020.113 dblp:conf/icalp/BojanczykS20 fatcat:4nnelmpfhvhtllbo6o7w24ix3a
Register automata and transducers are popular formalisms for specifying and modelling such systems. ... Importantly, the data domain (ℕ, =, <) with natural order is ω-regularly approximable, and its closer examination reveals that the synthesis problem is decidable in time doubly exponential in the number ... Furthermore, universal register automata are closed, in linear time, under intersection. ...arXiv:2105.09978v3 fatcat:xyb2whrphncgnlit2omn2up2fm
Lecture Notes in Computer Science
Automata theory on finite and infinite words, functions realized by finite automata, pushdown automata and context-free languages. Models for parallelism: trace theory, automata resynchronization. ... Automata and number systems. Combinatorics of words, combinatorial theory of groups and semigroups. ... Automata theory -especially the theory of finite automata -is a basic knowledge in computer science, known by all and used by everyone, which belongs to the framework for such a long time that it is hardly ...doi:10.1007/3-540-48685-2_28 fatcat:qsij53psvffnzblrr6xs5rxdfi
By definition, transducer integer sequences are integer sequences produced, under a suitable interpretation, by finite automata encoding tree morphisms (length and prefix preserving transformations of ... Transducer integer sequences are related to the notion of self-similar groups and semigroups, as well as to the notion of automatic sequences. ... The geometric language and insight coming from the interpretation of the action of the automata as tree automorphisms greatly simplifies the presentation and helps in the understanding of the underlying ...arXiv:math/0612080v1 fatcat:m5z53iz5grco7lg3tnqpqax5ze
It utilizes the concepts of starting functions, channels and action functions. Methods for function calculation are suggested.” ... For unambiguous transducers, equivalence is decidable in polynomial time.” Hoffmann, Frank 84b:68061 * |-Kiesel-Automaten in Labyrinthen. ...
Lecture Notes in Computer Science
The main idea is to use regular languages as the representation of sets of configurations, and finite-state transducers to describe transition relations. ... integers, and other linear data structures. ... Regular sets and transducers must then be represented by Büchi automata. ...doi:10.1007/978-3-540-28644-8_3 fatcat:xblrrywqhzhpbfqvudbhfrl5za
In the case of finite-state transducers, we give an efficient algorithm for testing functionality in time O(|Q|? ... Summary: “Weighted automata and transducers are powerful de- vices used in many large-scale applications. ...
« Previous Showing results 1 — 15 out of 2,228 results