Add to ORKGInternational audienceWe present an XML format that allows to describe a large class of finite weighted automata and transducers. Our design choices stem from our policy of making the implementation as simple as possible. This format has been tested for the communication between the modules of our automata manipulation platform Vaucanson, but this document is less an experiment report than a position paper intended to open the discussion among the community of automata software writers
Regular expression pattern matching for XML We propose regular expression pattern matching as a core...
This Bachelor's Thesis is about the theory of converting regular expression to finate state machine ...
AbstractWith motivation from considerations in XML database theory and model checking, data strings ...
International audienceWe present an XML format that allows to describe a large class of finite weigh...
This paper presents an XML description format for the automaton representation. We introduce the pro...
Last year, we started to work on a new proposal of an XML automata description format, now called FS...
AbstractAutomata play an important role for the theoretical foundations of XML data management, but ...
International audienceThis paper studies several formalisms to specify quantitative properties of fi...
In this paper, we introduce the new concept of interactive automata by proposing that states are not...
In this diploma work the concept of formal language is presented, introducing the ideas related to ...
In this paper we present the new version of a tool to assist in teaching formal languages and autom...
This thesis provides a summary of knowledge of regular expressions, finite automatas and transformat...
Abstract. We present a type system for automata and rational expres-sions, expressive enough to enco...
The advent of XML initiated a symbiosis between document research, databases and formal languages (s...
The author, who died in 1984, is well-known both as a person and through his research in mathematica...
Regular expression pattern matching for XML We propose regular expression pattern matching as a core...
This Bachelor's Thesis is about the theory of converting regular expression to finate state machine ...
AbstractWith motivation from considerations in XML database theory and model checking, data strings ...
International audienceWe present an XML format that allows to describe a large class of finite weigh...
This paper presents an XML description format for the automaton representation. We introduce the pro...
Last year, we started to work on a new proposal of an XML automata description format, now called FS...
AbstractAutomata play an important role for the theoretical foundations of XML data management, but ...
International audienceThis paper studies several formalisms to specify quantitative properties of fi...
In this paper, we introduce the new concept of interactive automata by proposing that states are not...
In this diploma work the concept of formal language is presented, introducing the ideas related to ...
In this paper we present the new version of a tool to assist in teaching formal languages and autom...
This thesis provides a summary of knowledge of regular expressions, finite automatas and transformat...
Abstract. We present a type system for automata and rational expres-sions, expressive enough to enco...
The advent of XML initiated a symbiosis between document research, databases and formal languages (s...
The author, who died in 1984, is well-known both as a person and through his research in mathematica...
Regular expression pattern matching for XML We propose regular expression pattern matching as a core...
This Bachelor's Thesis is about the theory of converting regular expression to finate state machine ...
AbstractWith motivation from considerations in XML database theory and model checking, data strings ...