New algorithms for deciding the injectivit y of the global update funct ion associat ed with a cellular automaton C A of dimension one are presented. This is done by interpreting each ordered pair dete rmined by the local update function as th e edge of a labeled directed graph GR which has the prope rty that each bi-infinite sequence of states of the cellular automaton is th e sequence of inpu...

Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. Current planners for TEGs prune the search space during planning via goal progression. However, the fastest classical domain-independent planners rely on heuristic search. In this paper we propose a method for planning with propositional TEGs using heuristic search. To this end, ...

Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. Current planners for TEGs prune the search space during planning via goal progression. However, the fastest classical domain-independent planners rely on heuristic search. In this paper we propose a method for planning with propositional TEGs using heuristic search. To this end, ...

A finite automaton .d with a distance function d is a sextuple, (C, Q, M, S, F, d), such that C is the input alphabet, Q is the finite set of states, M: Q x C -+ 2Q is the transition function, S c Q and F c Q are the sets of initial and final states, respectively, d: Q x C x Q -+ (0, 1, co } is the distance function, where co denotes infinity, and d satisfies the following: for any (q,a,q’)E Q ...

A Watson-Crick automaton is recently introduced as a computational model of DNA computing framework. It works on tapes consisting of double stranded sequences of symbols. Symbols placed on the corresponding cells of the double-stranded sequences are related by a complimentary relation. In this paper, we investigate a variation of Watson-Crick automata in which both heads read the tape in revers...

We show that for all n and α such that 1 ≤ n ≤ α ≤ 2 there is a minimal n-state nondeterministic finite automaton whose equivalent minimal deterministic automaton has exactly α states.

The aim of the paper is to concoct a novel algorithm for the metamorphosis of parallel regular expressions to ε-free nondeterministic finite automata. For a given parallel regular expression r, let m be the number of symbols that occur in r and let C denote the number of concatenation operators in r. In the worst case, 2m+1 states are required for the construction of the non-deterministic finit...

In this paper, we first define the notion of a complete general fuzzyautomaton with threshold c and construct an $H_{nu}$- group, as well as commutativehypergroups, on the set of states of a complete general fuzzy automatonwith threshold c. We then define invertible general fuzzy automata, discussthe notions of “homogeneity, “separation, “thresholdness connected, “thresholdnessinner irreducible...

A two-way finite automaton is sweeping if its input head can change direction only on the end-markers. For each n ≥ 2, we exhibit a problem that can be solved by a O(n)-state sweeping LasVegas automaton, but needs 2 states on every sweeping deterministic automaton.

We introduce a new geometric tool for analyzing groups of finite au-tomata. To each finite automaton we associate a square complex. The square complex is covered by a product of two trees iff the automaton is bi-reversible. Using this method we give examples of free groups and of Kazhdan groups which are generated by the different states of one finite (bi-reversible) automaton. We also reproduc...