In this paper, we propose an architecture of oritatami systems, a mathematical model RNA cotranscriptional folding, with which one can simulate arbitrary nondeterministic finite automaton (NFA) in unified manner. The system is known to be Turing-universal but the simulation available so far requires 542 bead types and O ( t 4 log 2 ? ) steps order Turing machine. employs only 337 just | Q ? NFA...

This paper surveys some new tools and methods for formally verifying time performance properties of systems that satisfy timing assumptions. The techniques are potentially of practical beneet in the validation of real-time process control and communication systems. The tools and methods include nondeterministic timed automaton models, invariant assertion and simulation techniques for proving wo...

This paper introduces a mechanism for combining unbounded lookahead exploration with linear time complexity in a deterministic parser. The idea is to use a resolve parsing action in place of the classical reduce. The construction of shift-resolve parsers is presented as a two-step algorithm, from the grammar to a finite nondeterministic automaton, and from this automaton to the deterministic pa...

On every n-long input, every two-way finite automaton (fa) can reverse its input head O(n) times before halting. A fawith few reversals is an automaton where this number is only o(n). For every h, we exhibit a language that can be recognized by an h-state nondeterministic fa with few reversals, but requires Ω(2) states on every deterministic fa with few reversals.

Given an arbitrary (nondeterministic) finite state automaton A we consider the problem of computing the Hamming distance of the language L(A) that is accepted by the automaton. This quantity is simply the minimum Hamming distance between any pair of distinct words from the language L(A). We show an algorithm that solves the problem in time quadratic with respect to the size of the given automat...

GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from dealing with low-level data structures. In this case study, we present a graph program which minimizes finite automata. The program represents an automaton by its transition diagram, computes the state equivalence relation, and merges...

In this paper we show that shuue languages are contained in one-way-NSPACE(logn) thus in P. We consider the class of shuue languages which emerges from the class of nite languages through regular operations (union, concatenation, Kleene star) and shuue operations (shuue and shuue closure). For every shuue expression E we construct a shuue automaton which accepts the language generated by E and ...

A one-counter automaton is a pushdown automaton over a singleton stack alphabet. We prove that the bisimilarity of processes generated by nondeterministic one-counter automata (with no ε-steps) is in PSPACE. This improves the previously known decidability result (Jančar 2000), and matches the known PSPACE lower bound (Srba 2009). We add the PTIME-completeness result for deciding regularity (i.e...

The aim of this paper is to investigate how subset construction performs on specific families of automata. A new upper bound on the number of states of the subset-automaton is established in the case of homogeneous automata. The complexity of the two basic steps of subset construction, i.e. the computation of deterministic transitions and the set equality tests, is examined depending on whether...

Choices made by nondeterministic word automata depend on both the past (the prefix of the word read so far) and the future (the suffix yet to be read). In several applications, most notably synthesis, the future is diverse or unknown, leading to algorithms that are based on deterministic automata. Hoping to retain some of the advantages of nondeterministic automata, researchers have studied res...