共 50 条
- [34] Head and state hierarchies for unary multi-head finite automata Acta Informatica, 2014, 51 : 553 - 569
- [35] BOUNDED SEMILINEAR LANGUAGES ARE EXACTLY THOSE RECOGNIZABLE BY ONE-WAY, NONDETERMINISTIC MULTI-HEAD FINITE AUTOMATA - PRELIMINARY REPORT NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1974, 21 (01): : A247 - A248
- [39] 2-WAY SEQUENTIAL TRANSDUCTIONS AND STACK AUTOMATA INFORMATION AND CONTROL, 1971, 18 (05): : 404 - &
- [40] BASIC TECHNIQUES FOR 2-WAY FINITE AUTOMATA FORMAL PROPERTIES OF FINITE AUTOMATA AND APPLICATIONS, 1989, 386 : 56 - 64