One-way multihead finite automata and 2-bounded languages-Reference-Cited by-同舟云学术

One-way multihead finite automata and 2-bounded languages

Published:1990-12 Issue:1 Volume:23 Page:107-139
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Kutyłowski Mirosław

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF02090769.pdf

Reference12 articles.

1. Lecture Notes in Computer Science;M. Chrobak,1985

2. Chrobak, M., Hierarchies of one-way multihead automata languages,Theoretical Computer Science,48 (1986), pp. 153–181 (a full version of [1]).

3. Chrobak, M., and Li, M.,k+1 heads are better thank for PDAs,Journal of Computer and System Sciences,37 (1988), pp. 144–155.

4. Chrobak, M., and Rytter, W., Remarks on string-matching and one-way multihead automata,Information Processing Letters,24 (1987), pp. 325–329.

5. Galil, Z., Open problems in stringology, in:Combinatorial Algorithms on Words (A. Apostolico and Z. Galil, eds.), Springer-Verlag, Berlin, 1974, pp. 350–359.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. STATELESS ONE-WAY MULTI-HEAD FINITE AUTOMATA WITH PEBBLES;International Journal of Foundations of Computer Science;2014-12

2. Head and state hierarchies for unary multi-head finite automata;Acta Informatica;2014-08-27

3. One-Way Multi-Head Finite Automata with Pebbles But No States;Developments in Language Theory;2013

4. States and Heads Do Count for Unary Multi-head Finite Automata;Developments in Language Theory;2012

5. Multihead one-way finite automata;Theoretical Computer Science;1991-08