Filters








90 Hits in 2.1 sec

Size Reduction of Multitape Automata [chapter]

Hellis Tamm, Matti Nykänen, Esko Ukkonen
2005 Lecture Notes in Computer Science  
reduction procedure and the multitape automata reduction algorithm by turn on A, at one time starting with the NFA reduction algorithm and the other time starting with the multitape automata reduction  ...  Example: applying the NFA reduction algorithm to the automaton for reversal(x, y) predicate A more general multitape automata reduction algorithm Apply two sequences of algorithms consisting of the NFA  ... 
doi:10.1007/978-3-540-30500-2_39 fatcat:uklibjhglrgb5mt62iyidbin34

On size reduction techniques for multitape automata

Hellis Tamm, Matti Nykänen, Esko Ukkonen
2006 Theoretical Computer Science  
We present a method for size reduction of two-way multitape automata.  ...  reduction algorithm, on our multitape automata.  ...  Now, applying the multitape automata reduction algorithm of Section 4 after the NFA reduction can lead to a further size reduction of the automaton.  ... 
doi:10.1016/j.tcs.2006.07.027 fatcat:idzi4hxph5gxphnfi22kiqjyfa

Page 4892 of Mathematical Reviews Vol. , Issue 88i [page]

1988 Mathematical Reviews  
types of stack automata and pushdown automata; deterministic, nondeterministic, probabilistic and alternating ma- chines.  ...  The proof is direct (no top-level induction on the size of G) and makes use of a special spanning tree in G. Query graphs have applications in database security.  ... 

Undecidable Properties of Self-affine Sets and Multi-tape Automata [chapter]

Timo Jolivet, Jarkko Kari
2014 Lecture Notes in Computer Science  
These results are obtained by studying a particular class of self-affine sets associated with multi-tape automata.  ...  We first establish the undecidability of some language-theoretical properties of such automata, which then translate into undecidability results about their associated self-affine sets.  ...  To do so, we take the approach of Dube [Dub93] and we associate self-affine sets with computational devices called multitape automata, which are finite automata acting on several tapes, with an independent  ... 
doi:10.1007/978-3-662-44522-8_30 fatcat:dm5e3yyxyrgfxbo5ekrhliwbw4

Author index

2006 Theoretical Computer Science  
Ukkonen, On size reduction techniques for multitape automata (2) 234-246 Tanaka, A., see E. Tomita (1) 28-42 Thomas, W., see C.S. Althoff ( 2) 224-233 Ting, H.F., see H.F.  ...  ., The structure of subword graphs and suffix trees of Fibonacci words (2) 211-223 Rytter, W., see C. Bastien (2) 124-134 Simplot-Ryl, I., see A. Bailly (2) 108-123 Smith, J.R., see C.  ... 
doi:10.1016/s0304-3975(06)00657-8 fatcat:j3xpbct5uzgcri4xjhttecf4me

Abstracts

1969 IBM Systems Journal  
In particular it is shown that this model is incom- parable to the nondeterministic multitape finite automata and is strictly weaker than two-way multitape finite automata.  ...  Multitape Finite Automata with Rewind Instructions, A. L. Rosenberg, Journal of Computer and System Sciences 1, No. 3, 299-315 (October 1967).  ... 
doi:10.1147/sj.81.0088 fatcat:ccmf4djtrbbwlmblgy5pf3i2iq

Page 2078 of Mathematical Reviews Vol. , Issue 87d [page]

1987 Mathematical Reviews  
Loui], Space-bounded simulation of multitape Turing machines [Math. Systems Theory 14 (1981), no. 3, 215-222; MR 82g:03071] (pp. 102-112); Yu.  ...  Salomaa, Arto (SF-TURK) * Computation and automata. With a foreword by Grzegorz Rozenberg. Encyclopedia of Mathematics and its Applications, 25.  ... 

Page 4312 of Mathematical Reviews Vol. , Issue 88h [page]

1988 Mathematical Reviews  
One of the problems in chip design is that increasing the scale factor, i.e., decreasing the feature size, leads to a decrease of the propagation speed of elec- trical signals relative to the switching  ...  (BG-HIEE) A theorem on the reduction of a topological automaton. (Bulgarian. English and Russian summaries) Godishnik Vissh. Uchebn. Zaved. Prilozhna Mat. 21 (1985), no. 1, 151-156 (1986).  ... 

Uniform characterizations of non-uniform complexity measures

José L. Balcázar, Josep Díaz, Joaquim Gabarró
1985 Information and Control  
Non-uniform complexity measures originated in automata and formal languages theory are characterized in terms of well-known uniform complexity classes.  ...  The initial index of languages is introduced by means of several computational models.  ...  S = {On$x$i$j$u/j ~ 6n As the size of the automata grows polynomially, it is easy to see that S is sparse.  ... 
doi:10.1016/s0019-9958(85)80026-7 fatcat:4kpvj2xa6fb25okxhykiyytpbe

Page 437 of Mathematical Reviews Vol. , Issue 92a [page]

1992 Mathematical Reviews  
reduction of the problem mentioned above to integer division with remainder.  ...  Summary: “We present two families of Boolean circuits of depth O(log n) and size n") (P uniform), and of depth O(log n log log n) and size 1") (log-space uniform) for computing the modular inverse of an  ... 

Page 3229 of Mathematical Reviews Vol. , Issue 97E [page]

1997 Mathematical Reviews  
) Iterative pairs and multitape automata.  ...  In this paper, it is proved that grammar systems with (prescribed or free) teams (of constant size at least two or arbitrary size) working as long as they can, characterize the family of languages generated  ... 

On decision problems for parameterized machines

Oscar H. Ibarra, Igor Potapov, Hsu-Chun Yen
2010 Theoretical Computer Science  
Let C (s, m, t) be the class of nondeterministic multitape Turing machine (TM) acceptors with a two-way read-only input, at most s states, at most m read-write worktapes, and at most t symbols in the worktape  ...  In this paper, we investigate various decision problems concerning parameterized versions of some classes of machines.  ...  Acknowledgements The work of Oscar H.  ... 
doi:10.1016/j.tcs.2009.12.013 fatcat:ymhp6yzxwbaifkhohrsduxcicm

Pushdown automata with reversal-bounded counters

Tat-Hung Chan
1988 Journal of computer and system sciences (Print)  
Second, l-way pushdown automata augmented with l-reversal counters accept in linear time and are therefore equivalent to l-way simple multihead pushdown automata.  ...  The proof of the main result yields three interesting corollaries.  ...  of time-bounded multitape TMs.  ... 
doi:10.1016/0022-0000(88)90008-6 fatcat:26qljo2awzbnxaltiwt7bz64ti

Automata and Fixpoints for Asynchronous Hyperproperties [article]

Jens Oliver Gutsfeld, Markus Müller-Olm, Christoph Ohrem
2020 arXiv   pre-print
In this paper, we systematically study asynchronous analyses for hyperproperties by introducing both a novel automata model (Alternating Asynchronous Parity Automata) and the temporal fixpoint calculus  ...  The high expressive power of both models is evidenced by the fact that decision problems of interest are highly undecidable, i.e. not even arithmetical.  ...  Note that for our reduction to be polynomial, each of the regular language acceptors and regular transducers have to be of polynomial size in the input size, which they indeed are.  ... 
arXiv:2010.11605v1 fatcat:hi2hr2ghibhf7ibff255sxnnba

Regularity and Related Problems for Deterministic Pushdown Automata

Leslie G. Valiant
1975 Journal of the ACM  
, program schema CR CATEGORIES. 5 22, 5.24 has shown that the function defined as the size of the largest reduced finite automaton  ...  The regularity problem itself is analyzed in detail, and Stearns' dec~mon procedure for this as improved by one level of exponentiatlon Upper bounds, close to known lower bounds, are obtained for the succinctness  ...  Reductions The first theorem is for a class of containment problems.  ... 
doi:10.1145/321864.321865 fatcat:5zazbxhmnrgxnbgbi6gpf5vaga
« Previous Showing results 1 — 15 out of 90 results