ω-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.

Regular Processes and Timed Automata

Abstract: In [10], an algebra for timed automata has been introduced. In this article, we introduce a syntactic characterisation of finite timed automata in terms of that process algebra. We show that regular processes, i.e., processes defined using finitely many guarded recursive equations, are as expressive as finite timed automata. The proof uses only the axiom system and unfolding of recursive equations. Since the proofs are basically algorithms, we also provide an effective method to translate from one model into the other. A remarkable corollary of these proofs is that regular recursive specifications may need one clock less than timed automata in order to represent the same process.

Defining Parallel Automata and their Conflicts

Abstract: We define and classify a family of parallel automata (for Real-Time and Telecommunication modeling) in the context of a synchronous execution. First, an abstract form of Parallel automata is proposed as a generalization of various "Extended-Finite-states- Machines" found in the literature. Then, two implementable forms of Parallel Automata are presented : A "global Parallel automaton with private states" and sets of " Synchronous and Hierarchic Parallel automata with local states". An example of application is presented with these two formalism. We also define and classify various types of possible conflicts that can occur in Parallel automata. An example shows an application with various kinds of conflicts and their possible correction. In a companion paper (17), we have shown that a-priori detection of actual conflicts for parallel automata is P- space hard. In view of this, an approach for a-priori potential conflict detection is developed. The complexity of detecting potential conflicts is shown to be possible in polynomial time, if all automata conditions are conjunctions.

A Memory-efficient ε-Removal Algorithm for Weighted Acyclic Finite-State Automata

Abstract: Many NLP tasks based on finite-state automata create acyclic result automata which contain a lot of e-transitions. We propose an refinement of an existing algorithm for e-removal with a better memory consumption behavior in many practical cases.

Decomposing Timed Push Down Automata

Abstract: In this paper we define a particular type of timed push down automata. We show that the emptiness problem for this class is decidable. We also present a notion of homomorphism and parallel decomposition for these automata. These notions are a generalisation of the homomorphism and decomposition via partitions for finite automata.

Finite-state automata in information technologies

Abstract: A short review of applications of finite-state automata in some modern areas of computer science and technologies is presented. In particular, fields of application of finite-state automata in computer algebra, Petri nets, biology, and verification are considered.