Results 1  10
of
13
Algebraic specification and coalgebraic synthesis of Mealy machines
 In: Proceedings of FACS 2005. ENTCS
, 2006
"... We introduce the notion of functional stream derivative, generalising the notion of input derivative of rational expressions (Brzozowski 1964) to the case of stream functions over arbitrary input and output alphabets. We show how to construct Mealy automata from algebraically specified stream functi ..."
Abstract

Cited by 22 (11 self)
 Add to MetaCart
(Show Context)
We introduce the notion of functional stream derivative, generalising the notion of input derivative of rational expressions (Brzozowski 1964) to the case of stream functions over arbitrary input and output alphabets. We show how to construct Mealy automata from algebraically specified stream functions by the symbolic computation of functional stream derivatives. We illustrate this construction in full detail for various bitstream functions specified in the algebraic calculus of the 2adic numbers. This work is part of a larger ongoing effort to specify and model component connector circuits in terms of (functions and relations on) streams.
On the equivalence of Zautomata
 In ICALP 2005 (2005
"... Abstract. We prove that two automata with multiplicity in Z are equivalent, i.e. define the same rational series, if and only if there is a sequence of Zcoverings, coZcoverings, and circulations of −1, which transforms one automaton into the other. Moreover, the construction of these transformati ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
(Show Context)
Abstract. We prove that two automata with multiplicity in Z are equivalent, i.e. define the same rational series, if and only if there is a sequence of Zcoverings, coZcoverings, and circulations of −1, which transforms one automaton into the other. Moreover, the construction of these transformations is effective. This is obtained by combining two results: the first one relates coverings to conjugacy of automata, and is modeled after a theorem from symbolic dynamics; the second one is an adaptation of Schützenberger’s reduction algorithm of representations in a field to representations in an Euclidean domain (and thus in Z). 1
A unified construction of the Glushkov, follow and Antimirov automata
 Lecture Notes in Computer Science 4162 (2006
"... Abstract. Many techniques have been introduced in the last few decades to create free automata representing regular expressions: Glushkov automata, the socalled follow automata, and Antimirov automata. This paper presents a simple and unified view of all these free automata both in the case of u ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Many techniques have been introduced in the last few decades to create free automata representing regular expressions: Glushkov automata, the socalled follow automata, and Antimirov automata. This paper presents a simple and unified view of all these free automata both in the case of unweighted and weighted regular expressions. It describes simple and general algorithms with running time complexities at least as good as that of the best previously known techniques, and provides concise proofs. The construction methods are all based on two standard automata algorithms: epsilonremoval and minimization. This contrasts with the multitude of complicated and specialpurpose techniques and proofs put forward by others to construct these automata. Our analysis provides a better understanding of free automata representing regular expressions: they are all the results of the application of some combinations of epsilonremoval and minimization to the classical Thompson automata. This makes it straightforward to generalize these algorithms to the weighted case, which also results in much simpler algorithms than existing ones. For weighted regular expressions over a closed semiring, we extend the notion of follow automata to the weighted case. We also present the first algorithm to compute the Antimirov automata in the weighted case. 1
Rational and recognisable power series
 DRAFT OF A CHAPTER FOR THE HANDBOOK OF WEIGHTED AUTOMATA
"... ..."
Symbolic Synthesis of Mealy Machines from Arithmetic Bitstream Functions
"... In this paper, we describe a symbolic synthesis method which given an algebraic expression that specifies a bitstream function f, constructs a (minimal) Mealy machine that realises f. The synthesis algorithm can be seen as an analogue of Brzozowski’s construction of a finite deterministic automaton ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
(Show Context)
In this paper, we describe a symbolic synthesis method which given an algebraic expression that specifies a bitstream function f, constructs a (minimal) Mealy machine that realises f. The synthesis algorithm can be seen as an analogue of Brzozowski’s construction of a finite deterministic automaton from a regular expression. It is based on a coinductive characterisation of the operators of 2adic arithmetic in terms of stream differential equations. 1
Inside Vaucanson
 In Proceedings of Implementation and Application of Automata, 10th International Conference (CIAA), Sophia Antipolis
, 2005
"... Abstract. This paper presents some features of the Vaucanson platform. We describe some original algorithms on weighted automata and transducers (computation of the quotient, conversion of a regular expression into a weighted automaton, and composition). We explain how complex declarations due to th ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. This paper presents some features of the Vaucanson platform. We describe some original algorithms on weighted automata and transducers (computation of the quotient, conversion of a regular expression into a weighted automaton, and composition). We explain how complex declarations due to the generic programming are masked from the user and finally we present a proposal for an XML format that allows implicit descriptions for simple types of automata. 1
MultiTildeBar Derivatives
"... Abstract. Multitildebar operators allow us to extend regular expressions. The associated extended expressions are compatible with the structure of Glushkov automata and they provide a more succinct representation than standard expressions. The aim of this paper is to examine the derivation of mult ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
Abstract. Multitildebar operators allow us to extend regular expressions. The associated extended expressions are compatible with the structure of Glushkov automata and they provide a more succinct representation than standard expressions. The aim of this paper is to examine the derivation of multitildebar expressions. Two types of computation are investigated: Brzozowski derivation and Antimirov derivation, as well as the construction of the associated automata. 1
A general framework for the derivation of regular expressions
 RAIRO Inform. Théor. Appl., Special Issue of Journées Montoises
, 2014
"... ar ..."
(Show Context)
Algorithms for Glushkov Kgraphs
, 2009
"... The automata arising from the well known conversion of regular expression to non deterministic automata have rather particular transition graphs. We refer to them as the Glushkov graphs, to honour his nice expressiontoautomaton algorithmic short cut [10]. The Glushkov graphs have been characterize ..."
Abstract
 Add to MetaCart
(Show Context)
The automata arising from the well known conversion of regular expression to non deterministic automata have rather particular transition graphs. We refer to them as the Glushkov graphs, to honour his nice expressiontoautomaton algorithmic short cut [10]. The Glushkov graphs have been characterized [6] in terms of simple graph theoretical properties and certain reduction rules. We show how to carry, under certain restrictions, this characterization over to the weighted Glushkov graphs. With the weights in a semiring K, they are defined as the transition Glushkov Kgraphs of the Weighted Finite Automata (WFA) obtained by the generalized Glushkov construction [4] from the Kexpressions. It works provided that the semiring K is factorial and the Kexpressions are in the so called star normal form (SNF) of BrüggemanKlein [2]. The restriction to the factorial semiring ensures to obtain algorithms. The restriction to the SNF would not be necessary if every Kexpressions were equivalent to some with the same litteral length, as it is the case for the boolean semiring B but remains an open question for a general K.
Draft of a chapter for the HANDBOOK OF WEIGHTED AUTOMATA
"... 2.1 Series over a graded monoid.................................. 4 ..."
(Show Context)