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
TL;DR: In this paper, weighted/priced timed automata are presented, an extension of timed automaton with costs, and several interesting problems on that model are solved.
43 citations
TL;DR: The enumeration of automata in the natural setting of the power group is reviewed, and the aid of the Power Group Enumeration Theorem is extended to enumerate automata with initial and terminal states.
Abstract: Harary ( 1960, 1964), in a survey of 27 unsolved problems in graphical enumeration, asked for the number of different finite automata. Recently, Harrison (1965) solved this problem, but without considering automata with initial and final states. With the aid of the Power Group Enumeration Theorem (Harary and Palmer, 1965, 1966) the entire problem can be handled routinely. The method involves a confrontation of several different operations on permutation groups. To set the stage, we enumerate ordered pairs of functions with respect to the product of two power groups. Finite automata are then concisely defined as certain ordered pah's of functions. We review the enumeration of automata in the natural setting of the power group, and then extend this result to enumerate automata with initial and terminal states.
43 citations
TL;DR: A recursive relation is proved which enables the characteristic polynomial to be efficiently calculated, and minimal cost, maximal length generators of this type are listed for sizes up to 500.
Abstract: This paper introduces a new class of two-dimensional linear cellular automata and derives a number of their properties. A recursive relation is proved which enables the characteristic polynomial to be efficiently calculated, and minimal cost, maximal length generators of this type are listed for sizes up to 500. A theoretical analysis of the two vector transition properties of the cellular automata is given and it is shown that, for testing sequential faults over a set of standard benchmarks, the two-dimensional cellular automata perform, on average, better than one-dimensional linear hybrid cellular automata, and much better than linear finite shift registers.
42 citations
04 Jun 2007
TL;DR: A variation of Watson-Crick automata in which both heads read the doubled DNA strand form 5' to 3' is introduced, and the sensing version of these automata recognize exactly the linear context-free languages.
Abstract: In this paper we introduce a variation of Watson-Crick automata in which both heads read the doubled DNA strand form 5' to 3'. The sensing version of these automata recognize exactly the linear context-free languages. The deterministic version is not so powerful, but all fixed-rated linear (for instance even-linear) languages can be accepted by them. Relation to other variations of Watson-Crick automata and pushdown automata are presented. The full-reading version of sensing 5′ → 3′ automata recognizes non context-free languages as well.
42 citations
01 Jan 1997
TL;DR: This chapter studies the implications of bounding the complexity of players’ strategies in long term interactions by measuring the size of the minimal automaton that can implement it.
Abstract: This chapter studies the implications of bounding the complexity of players’ strategies in long term interactions. The complexity of a strategy is measured by the size of the minimal automaton that can implement it.
42 citations