Results 1  10
of
12
Interactive manipulation of regular objects with FAdo
 In Proceedings of 2005 Innovation and Technology in Computer Science Education (ITiCSE 2005). ACM
, 2005
"... FAdo 1 is an ongoing project which aims the development of an interactive environment for symbolic manipulation of formal languages. In this paper we focus in the description of interactive tools for teaching and assisting research on regular languages, and in particular finite automata and regular ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
FAdo 1 is an ongoing project which aims the development of an interactive environment for symbolic manipulation of formal languages. In this paper we focus in the description of interactive tools for teaching and assisting research on regular languages, and in particular finite automata and regular expressions. Those tools implement most standard automata operations, conversion between automata and regular expressions, and word recognition. We illustrate their use in training and automatic assessment. Finally we present a graphical environment for editing and interactive visualisation.
Subset construction complexity for homogeneous automata, position automata and ZPCstructures
 Theoretical Computer Science
, 2001
"... The aim of this paper is to investigate how subset construction performs on specific families of automata. A new upper bound on the number of states of the subsetautomaton is established in the case of homogeneous automata. The complexity of the two basic steps of subset construction, i.e. the comp ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
The aim of this paper is to investigate how subset construction performs on specific families of automata. A new upper bound on the number of states of the subsetautomaton is established in the case of homogeneous automata. The complexity of the two basic steps of subset construction, i.e. the computation of deterministic transitions and the set equality tests, is examined depending on whether the nondeterministic automaton is an unrestricted one, an homogeneous one, a position one or a ZPCstructure, which is an implicit construction for a position automaton.
FAdo and GUItar: tools for automata manipulation and visualization
 14th CIAA 2009, volume 5642 of LNCS
, 2009
"... Abstract. FAdo is an ongoing project which aims to provide a set of tools for symbolic manipulation of formal languages. To allow highlevel programming with complex data structures, easy prototyping of algorithms, and portability (to use in computer grid systems for example), are its main features. ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
Abstract. FAdo is an ongoing project which aims to provide a set of tools for symbolic manipulation of formal languages. To allow highlevel programming with complex data structures, easy prototyping of algorithms, and portability (to use in computer grid systems for example), are its main features. Our main motivation is the theoretical and experimental research, but we have also in mind the construction of a pedagogical tool for teaching automata theory and formal languages. For the graphical visualization and interactive manipulation a new interface application, GUItar, is being developed. In this paper, we describe the main components of the FAdo system as well as the basics of the graphical interface and editor, the export/import filters and its generic interface with external systems, such as FAdo. 1
On Reversible Automata
"... A reversible automaton is a finite (possibly incomplete) automaton in which each letter induces a partial onetoone map from the set of states into itself. We give four nontrivial characterizations of the languages accepted by a reversible automaton equipped with a set of initial and final states ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
A reversible automaton is a finite (possibly incomplete) automaton in which each letter induces a partial onetoone map from the set of states into itself. We give four nontrivial characterizations of the languages accepted by a reversible automaton equipped with a set of initial and final states and we show that one can effectively decide whether a given rational (or regular) language can be accepted by a reversible automaton. The first characterization gives a description of the subsets of the free group accepted by a reversible automaton that is somewhat reminiscent of Kleene’s theorem. The second characterization is more combinatorial in nature. The decidability follows from the third – algebraic – characterization. The last characterization relates reversible automata to the profinite group topology of the free monoid.
The design and implementation of the FIRE engine: A C++ toolkit for FInite automata and Regular Expressions
, 1994
"... This paper describes the design and implementation of version 1.1 of the FIRE engine. The FIRE engine is a C++ class library implementing finite automata and regular expression algorithms. The algorithms implemented in the toolkit are almost all of those presented in the taxonomies of finite automa ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
This paper describes the design and implementation of version 1.1 of the FIRE engine. The FIRE engine is a C++ class library implementing finite automata and regular expression algorithms. The algorithms implemented in the toolkit are almost all of those presented in the taxonomies of finite automata algorithms [Wat93a, Wat93b]. The reader is assumed to be familiar with the two taxonomies and with advanced C++ programming techniques. The toolkit is implemented largely in an objectoriented style, with finite automata and regular expressions being defined as classes. All of the classes and functions in the toolkit are presented in the same format. For each class (or function) the format includes a short description of its behaviour, details of its implementation, and techniques for improving its performance. CONTENTS Contents 1 Introduction 3 1.1 Coding conventions and performance issues : : : : : : : : : : : : : : : : : : : : : : 3 1.1.1 Performance tuning : : : : : : : : : : : : ...
Some Results on the DotDepth Hierarchy
, 1992
"... : In this paper we pursue the study of the decidability of the dotdepth hierarchy. We give an e#ective lower bound for the dotdepth of an aperiodic monoid. The main tool for this is the study of a certain operation on varieties of finite monoids in terms of Mal'cev product. We also prove the equal ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
: In this paper we pursue the study of the decidability of the dotdepth hierarchy. We give an e#ective lower bound for the dotdepth of an aperiodic monoid. The main tool for this is the study of a certain operation on varieties of finite monoids in terms of Mal'cev product. We also prove the equality of two decidable varieties which were known to contain all dotdepth two monoids. Finally, we restrict our attention to inverse monoids, and we prove that the class of inverse dotdepth two monoids is locally finite. In this paper we pursue the study of the dotdepth hierarchy, a hierarchy of starfree (i.e. recognizable aperiodic) languages with connections to finite monoid theory, formal logic (Thomas [30]) and computational complexity (Barrington and Therien [1]). The dotdepth hierarchy was first introduced by Brzozowski and Cohen [3] in 1971 and was studied by numerous authors since. It consists in a strictly increasing sequence of classes of starfree languages whose union is the c...
An introduction to the FIRE engine: A C++ toolkit for FInite automata and Regular Expressions
, 1994
"... This paper is an introduction to the programmer's interface of version 1.1 of the FIRE engine. The FIRE engine is a C++ class library implementing finite automata and regular expression algorithms. The algorithms implemented in the toolkit are almost all of those presented in the taxonomies of finit ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper is an introduction to the programmer's interface of version 1.1 of the FIRE engine. The FIRE engine is a C++ class library implementing finite automata and regular expression algorithms. The algorithms implemented in the toolkit are almost all of those presented in the taxonomies of finite automata algorithms [Wat93a, Wat93b]. None of the implementation details of the library are discussed  such design and implementation details are given in [Wat94]. The toolkit is unique in providing implementations of all of the known algorithms for constructing finite automata. The implementations, which were developed with efficiency in mind, are intended for use in production quality applications. No shell or graphical userinterface is provided, as the toolkit is intended for integration into applications. The implementations of the algorithms follow directly from the abstract algorithms appearing in [Wat93a, Wat93b]. As such, the toolkit also serves as an educational example of the...
A Reexamination of the Glushkov and Thompson Constructions
, 1998
"... We reexamine the relationship between the two most popular methods for transforming a regular expression into a finitestate machine: the Glushkov and Thompson constructions. These methods have received more attention recently because of the Standard Generalized Markup Language (SGML) and a revival ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We reexamine the relationship between the two most popular methods for transforming a regular expression into a finitestate machine: the Glushkov and Thompson constructions. These methods have received more attention recently because of the Standard Generalized Markup Language (SGML) and a revival of interest in symbolic toolkits for regular and contextfree expressions, grammars, and machines. We establish that: ffl Every Thompson machine is, in a sense we make precise, a Glushkov machine ffl Every Glushkov machine is hidden in the corresponding Thompson machine 1 Introduction Inductive construction of finitestate machines from regular expressions are a popular implementation technique in system utilities, such as awk and grep, and in software tools for regularexpression manipulation such as AMoRE [12], AUTOMATE [6] and Grail [13]. When implementing regularexpression tools the regular expressions are usually, but not always, compiled into an executable form based on finitestat...
Grail: Engineering Automata in C++
, 1993
"... Objects: Automata and regular expressions : : : : : 11 3.2 User level : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 12 3.3 Programmer interface : : : : : : : : : : : : : : : : : : : : : : 13 4 Software organization 16 4.1 System directories : : : : : : : : : : : : : : : : : : : : : : : ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Objects: Automata and regular expressions : : : : : 11 3.2 User level : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 12 3.3 Programmer interface : : : : : : : : : : : : : : : : : : : : : : 13 4 Software organization 16 4.1 System directories : : : : : : : : : : : : : : : : : : : : : : : : 16 4.2 Classes : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 17 4.3 A class directory : : : : : : : : : : : : : : : : : : : : : : : : : 17 4.4 Making the code : : : : : : : : : : : : : : : : : : : : : : : : : 19 4.5 Test directory : : : : : : : : : : : : : : : : : : : : : : : : : : : 19 5 Miscellaneous information 19 5.1 How do I obtain Grail? : : : : : : : : : : : : : : : : : : : : : 19 5.2 Related software systems : : : : : : : : : : : : : : : : : : : : 20 5.3 Future work : : : : : : : : : : : : : : : : : : : : : : : : : : : : 21 5.4 C++ references : : : : : : : : : : : : : : : : : : : : : : : : : : 21 5.5 Organizational quirks : : : : : : : : : : : : : : : : : : : : : :...
Report on Subproject S1: Existing Software
"... this report by describing the software dealing with finite automata. ..."