Filters








33 Hits in 3.3 sec

On two-way multihead automata

Oscar H. Ibarra
1973 Journal of computer and system sciences (Print)  
As a consequence, it is shown that deterministic two-way finite automata with n + 2 heads are strictly more powerful than deterministic two-way finite automata with n heads for each positive integer n.  ...  For each positive integer n, let -~eN(n ) be the class of sets accepted by a family of automata of type N, each with a read-only input with endmarkers and n two-way input heads.  ...  multihead finite automata Type 3: deterministic two-way multihead pushdown automata Type 4: nondeterministic two-way multihead pushdown automata We briefly describe the above devices which are formally  ... 
doi:10.1016/s0022-0000(73)80048-0 fatcat:46b4bqwoxbcolaqgiicy7vwwvm

Page 2808 of Mathematical Reviews Vol. , Issue 92e [page]

1992 Mathematical Reviews  
and one-way multihead finite automata.  ...  We say that a one-way multihead finite automaton (1-MFA) WN sorts L, if for each w = 1% « 1% *---* 1% the automaton N stops in a state which determines a permutation 6 over {1,2,---,n} for which a5(1)  ... 

Database Query Processing Using Finite Cursor Machines

Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche
2008 Theory of Computing Systems  
The model describes quite faithfully what happens in so-called "one-pass" and "two-pass query processing". Technically, the model is described in the framework of abstract state machines.  ...  Keywords Database · Relational algebra · Semijoin · Query processing Introduction We introduce and analyze finite cursor machines, an abstract model of database query processing. 1 Data elements are viewed  ...  One-way multihead deterministic finite state automata are devices with a finite state control, a single read-only tape with a right endmarker $ and a finite number of reading heads which move on the tape  ... 
doi:10.1007/s00224-008-9137-7 fatcat:3khjjxxv5nanhodj5kzo7zwcfm

Database Query Processing Using Finite Cursor Machines [chapter]

Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche
2006 Lecture Notes in Computer Science  
The model describes quite faithfully what happens in so-called "one-pass" and "two-pass query processing". Technically, the model is described in the framework of abstract state machines.  ...  Keywords Database · Relational algebra · Semijoin · Query processing Introduction We introduce and analyze finite cursor machines, an abstract model of database query processing. 1 Data elements are viewed  ...  One-way multihead deterministic finite state automata are devices with a finite state control, a single read-only tape with a right endmarker $ and a finite number of reading heads which move on the tape  ... 
doi:10.1007/11965893_20 fatcat:ikkv6o65m5ee7bkoxcgudodqra

Cumulative index of volumes 1–50

1988 Theoretical Computer Science  
., Remarks on the complexity of nondeterministic counter languages GREIBACH, S.A., One way finite visit automata GREIBACH, S.A., Remarks on blind and partially blind one-way multicounter machines GREIBACH  ...  On rational definitions in complete algebras without rank INOUE, K., I. TAKANAMI, A. NAKAMURA and T. AE, One-way simple multihead finite automata INOUE, K., I. TAKANAMI and H.  ...  ROZENBERG, G. and R. VERRAEDT, On simulation and propagating EOL forms ROZENBERG, G., see 1J.J. Aalbersberg ROZENBERG, G., see A. Ehrenfeucht ROZENBERG, G., see A. Ehrenfeucht ROZENBERG, G., see A.  ... 
doi:10.1016/0304-3975(88)90002-3 fatcat:gasluptczbb6bfplioxrtdrlpy

Cumulative index volumes 1–100

1992 Theoretical Computer Science  
Ae, One-way simple multihead finite automata 9 (3) (1979) 31 l-328 Inoue, K.,seeM. Toda 24 (2) (1983) 179-194 Inoue, K., I. Takanami and H.  ...  Hromkovic, One-way simple multihead finite automata are not closed under concatenation 27 (l-2) (1983) 121-125 Duske, J. and R. Parchmann, Linear indexed languages 32 ( R.D. and B.C.  ... 
doi:10.1016/0304-3975(92)90292-n fatcat:ekwes6owtrco3lkfkiqagnketq

Reference List of Indexed Articles

2001 Information Processing Letters  
Rytter, Time complexity of languages recognized by one-way multihead pushdown automata 13 (4-5) (1981) 142-144 740. W.  ...  Akl, The design and analysis of a new hybrid sorting algorithm 10 (4-5) (1980) 213-218 571. A. Nakamura and K. Inoue, A remark on two-dimensional finite automata 10 (4-5) (1980) 219-222 572. A.  ... 
doi:10.1016/s0020-0190(01)00177-6 fatcat:vksyqyokdzdztflaez5hlnchxy

Abstracts of Current Computer Literature

1971 IEEE transactions on computers  
Directed Graphs and its Application to Synthesis and Reduction of Special Finite State Automata, R.  ...  , and the way they are displayed.  ... 
doi:10.1109/t-c.1971.223383 fatcat:vz3bijyj7bgjrkwzhjmw3pjzgm

Theory of computing in computer science education

Patrick C. Fischer
1971 Proceedings of the November 16-18, 1971, fall joint computer conference on - AFIPS '71 (Fall)  
Thus, theory of computing includes the theory of finite automata, formal languages, computability, computational complexity, and some aspects of switching circuit theory and logical design.  ...  B3, 16 and 17 above have been remarkably stable, perhaps because of the relative distance of their content from the frontiers of research.  ...  15 1968 pp 325-39 B18 J HARTMAN IS Tape reversal bounded Turing machine computations J Computer Syst Sci 2 1968 pp 117-35 B19 J HARTMAN IS A note on one-way and two-way automata Math Systems Theory  ... 
doi:10.1145/1478873.1478986 dblp:conf/afips/Fischer72 fatcat:fklwxch6hbachlbnyuvksa4kiy

Reference list of indexed articles

1999 Theoretical Computer Science  
Hromkovii-, One-way simple multihead finite automata are not closed under concatenation 27 (l-2) (1983) 121-125 541, J.Y. Halpern and J.H.  ...  Takanami and H. Taniguchi, A relationship between two-dimensional finite automata and three-way tape-bounded two-dimensional Turing machines 24 (3) (1983) 331-336 508. E.-R.  ... 
doi:10.1016/s0304-3975(98)00320-x fatcat:bdgg2ekzdjahdo7g2gtwbdye6m

Finite Presentations of Infinite Structures: Automata and Interpretations

Achim Blumensath, Erich Gr�del
2004 Theory of Computing Systems  
After a brief overview over different classes of finitely presentable structures, we focus on structures presented by automata or by model-theoretic interpretations.  ...  Although recursive model theory is very different from finite model theory, there have been some papers studying classical issues of finite model theory on recursive structures and recursive databases  ...  On the other hand, first-order logic is not effective on another popular extension of automatic graphs, the so-called rational graphs [41] , which are defined by asynchronous multihead automata.  ... 
doi:10.1007/s00224-004-1133-y fatcat:ry7oxqtttbdopamji2d25wdczu

Cumulative index volumes 1–200

1999 Theoretical Computer Science  
., On rational definitions in complete algebras without rank Inoue. K., I. Takanami.. A. Nakamura and T. Ae. One-way simple multihead finite automata Inoue, K., see M.  ...  , J. and K. moue, A note on realtime one-way synchronized alternating one-counter automata I08 (2) (1993) 393400 Hromkovic, J.. J. Kari and L.  ... 
doi:10.1016/s0304-3975(98)00321-1 fatcat:5wscxtd3qfdyrcvnx3dvavfb6i

Logspace self-reducibility

J.L. Balcazar
1988 [1988] Proceedings. Structure in Complexity Theory Third Annual Conference  
A general property derived from the definition is used to prove known results comparing uniform and nonuniform complexity clmses below polynomial time, and to obtain new ones regarding nondeterministic  ...  nonuniform classes and reducibility to context-free languages.  ...  Acknowledgements The author is grateful to Gerd Wechsung for suggesting this research, to Jacobo Torbn for interesting discussions and proofreading, to B. Jenner and B.  ... 
doi:10.1109/sct.1988.5261 dblp:conf/coco/Balcazar88 fatcat:bm7csm3rk5aoroxn4oklfrzhqa

Ranking and formal power series

Alberto Bertoni, Danilo Bruschi, Massimiliano Goldwurm
1991 Theoretical Computer Science  
Bruschi and M. Goldwurm, Ranking and formal power series, Theoretical Computer Science 79 (1991) 23-35.  ...  or by p-uniform boolean circuits of polynomial size and depth O(log n).  ...  in logarithmic space, and languages accepted by two-way deterministic pushdown automata or by multihead deterministic finite automata.  ... 
doi:10.1016/0304-3975(91)90144-q fatcat:e6bcguyfqfejdpcv3vk6yqphia

Equality languages and fixed point languages

Joost Engelfriet, Grzegorz Rozenberg
1979 Information and Control  
AND GRZEGORZ ROZENBERG University of Antwerp U1A, Wih'ijk, Belgium This paper considers equality hmguages and fixed-point languages of homomorphisms and deterministic gsm mappings.  ...  In particular we strengthen a result from Ehrenfeucht, A., and Rozenberg, G. [(1978), Theor. Comp.  ...  Given deterministic two-way multihead finite state transducers d and B we define a deterministic two-way multihcad finite automaton D as follows.  ... 
doi:10.1016/s0019-9958(79)90082-2 fatcat:nkc6tsbfbndehlesosm66dusse
« Previous Showing results 1 — 15 out of 33 results