Alternating Multihead Finite Automata

@article{King1988AlternatingMF,
  title={Alternating Multihead Finite Automata},
  author={K. N. King},
  journal={Theor. Comput. Sci.},
  year={1988},
  volume={61},
  pages={149-174}
}
  • K. N. King
  • Published 1 November 1988
  • Computer Science
  • Theor. Comput. Sci.

Multihead two-way probabilistic finite automata

  • I. Macarie
  • Computer Science
    Theory of Computing Systems
  • 2007
TLDR
A simple formula is obtained for the maximum inherent bandwidth of the configuration transition matrices associated with thek-head probabilistic finite automata processing a length-n input string and possibilities for a space-efficient deterministic simulation of Probabilistic automata are discussed.

On communication-bounded synchronized alternating finite automata

TLDR
A characterization of NP in terms of communication-bounded multihead synchronized alternating finite automata, namely, NP = ⋃k≥1L(SAFA(k-heads,nk -com)).

Tally Languages Accepted by Monte Carlo Pushdown Automata

TLDR
It is proved that languages over one-letter alphabet accepted by randomized one-way 1-tape Monte Carlo pushdown automata are regular.

Properties of Probabilistic Pushdown Automata (Extended Abstract)

TLDR
The difference between classes of languages such as P and PSPACE, NL and SAC1, PL and Diff>(#SAC1) is characterized as the difference between the number of stack symbols; that is, whether the stack alphabet contains one versus two distinct symbols.

On the Communication Complexity of Parallel Computation

TLDR
It is argued that the synchronized alternating finite automaton (SAFA) is a viable model for studying the communication complexity of parallel computation and a characterization of NP in terms of bounded-message multihead SAFA is given.

Tally Languages Accepted by Alternating Multitape Finite Automata

TLDR
It is proved that 4-tape lafa can accept a non-semilinear languages over one-letter alphabet with O(log log n)-bounded minimal leaf-size and the bound is optimal due to King's results.

Properties of Probabilistic Pushdown Automata

Some Results Concerning Two-Dimensional Turing Machines and Finite Automata

We show that emptiness is decidable for three-way two-dimensional nondeterministic finite automata as well as the universe problem for the corresponding class of deterministic automata. Emptiness is

Unary Languages Recognized by Two-Way One-Counter Automata

TLDR
This paper presents some non-trivial subsets of unary nonregular languages recognized by 2D1CAs by using the input head as a second counter, and presents simulations of two-way deterministic finite automata with linearly bounded counters and linear–space Turing machines.
...

References

SHOWING 1-10 OF 26 REFERENCES

Alternating pushdown automata

TLDR
It is shown that alternating pushdown automata are strictly more powerful than nondeterministic pushdown Automata and the number of alternations allowed during computations.

Some Remarks on Multihead Automata

TLDR
The main resuit s are a translational method for bounding the complexity of multihead pd languages in terms of the complcxiiv of single head pda languages, and an improved hierarchical resuit which shows that k + • 4 heads are better than k heads (forfinite state automata) even on languages over a single letter alphabet.

Two-Way Multihead Automata Over a One-Letter Alphabet

  • B. Monien
  • Computer Science
    RAIRO Theor. Informatics Appl.
  • 1980
TLDR
The classes of languages over a one-letter alphabet acceptable by deterministic {respectively nondeterministic} two-way k-headfinite automata are dénoteed and Hierarchy results are proved.

Characterizations of Time-Bounded Computations by Limited Primitive Recursion

Complexity measures usually are based on a machine model (1-tape Turing machine, multi-tape Turing machine, bounded activity machine, random access machine). The class of all functions which are

A Note on Two-Way Nondeterministic Pushdown Automata

Separating tape bounded auxiliary pushdown automata classes

TLDR
It is shown that, for auxiliary PDA fully constructable functions S0 and S1 satisfying S1 (n+1) ε o,(S0 (n)), S0 tape bounded AuxPDA are more powerful than S1 tape bounded auxiliary pushdown automata.

On Two-way Multihead Automata

  • O. Ibarra
  • Mathematics
    J. Comput. Syst. Sci.
  • 1973

Transformational methods and their application to complexity problems

  • B. Monien
  • Computer Science
    Acta Informatica
  • 1976
TLDR
There exists a j such that every language accepted by a nondeterministic one-way one-counter automaton is contained in Dj, which is the family of all languages accepted by deterministic j-head two-way finite automata.

Pushdown Automata with Counters

  • T. Kameda
  • Computer Science
    J. Comput. Syst. Sci.
  • 1972