Topic
ω-automaton
About: ω-automaton is a research topic. Over the lifetime, 2299 publications have been published within this topic receiving 68468 citations. The topic is also known as: stream automaton & ω-automata.
Papers published on a yearly basis
Papers
More filters
Journal Article•
TL;DR: It is proved that it should not eliminate bridge states until all non-bridge states are eliminated to obtain shorter regular expressions, and heuristics for state elimination are suggested that lead to shorterregular expressions based on vertical chopping and horizontal chopping.
Abstract: We consider the use of state elimination to construct shorter regular expressions from finite-state automata. Although state elimination is an intuitive method for computing regular expressions from finite-state automata, the resulting regular expressions are often very long and complicated. We examine the minimization of finite-state automata to obtain shorter expressions first. Then, we introduce vertical chopping based on bridge states and horizontal chopping based on the structural properties of given finite-state automata. We prove that we should not eliminate bridge states until we eliminate all non-bridge states to obtain shorter regular expressions. In addition, we suggest heuristics for state elimination that lead to shorter regular expressions based on vertical chopping and horizontal chopping. Note that we have omitted almost. all proofs in this preliminary version.
5 citations
07 Sep 1994
5 citations
21 Jun 1994
TL;DR: This paper gives conditions for a timed automaton with arbitrary constraint equations to have the simple path property and defines extended RQ timed automata which include all the examples in the literature and are easily tested for this property.
Abstract: Timed automata have been studied in the past and have been found to have a complexity dependent on the relative scale of the time constants involved in the timing constraints imposed, even if the timing constraints are restricted to the form x
5 citations
01 Aug 2015
TL;DR: Pumping lemmata are described for languages accepted by both non-deterministic and deterministic fuzzy multiset finite automata.
Abstract: The concept of fuzzy multiset finite automata was introduced recently by Wang et al. in [14]. The idea is elaborated towards deterministic fuzzy multiset finite automata and the corresponding languages. The languages are studied with respect to some closure properties. Pumping lemmata are described for languages accepted by both non-deterministic and deterministic fuzzy multiset finite automata.
5 citations
Dissertation•
01 Dec 2015
TL;DR: This thesis examines the practical possibility of a real world system for the automatic recognition and interpretation of machine-printed Finite State Automata diagrams using Constraint Multiset Grammars.
Abstract: An application capable of reading graphically-encoded information is beneficial to blind or visually impaired students. Such a system needs to recognize and understand visual markings and their arrangement as presented in a diagram image. In that light, this thesis examines the practical possibility of a real world system for the automatic recognition and interpretation of machine-printed Finite State Automata diagrams. The suggested system uses known image processing and pattern recognition methods to extract the visual markings from the diagram image pixels. A second stage, to interpret the meaning of the diagram, is based on modeling the language of Finite State Automata diagrams using Constraint Multiset Grammars. Our results show that a practical application for automatic interpretation of Finite State Automata diagrams is possible. iii Stellenbosch University https://scholar.sun.ac.za
5 citations