## 53 Citations

### Multihead two-way probabilistic finite automata

- Computer ScienceTheory of Computing Systems
- 2007

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

- Computer ScienceActa Informatica
- 2005

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

- Computer ScienceRANDOM
- 1997

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)

- Computer ScienceFCT
- 1995

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

- Computer ScienceMFCS
- 1993

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.

### Deterministic versus Nondeterministic Space in Terms of Synchronized Alternating Machines

- MathematicsTheor. Comput. Sci.
- 1994

### Tally Languages Accepted by Alternating Multitape Finite Automata

- Computer ScienceCOCOON
- 1997

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.

### Some Results Concerning Two-Dimensional Turing Machines and Finite Automata

- Computer ScienceFCT
- 1995

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

- Computer ScienceCIAA
- 2014

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

- Computer Science19th Annual Symposium on Foundations of Computer Science (sfcs 1978)
- 1978

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

- Computer ScienceRAIRO Theor. Informatics Appl.
- 1977

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

- Computer ScienceRAIRO Theor. Informatics Appl.
- 1980

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

- MathematicsICALP
- 1974

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…

### Separating tape bounded auxiliary pushdown automata classes

- Computer ScienceSTOC '77
- 1977

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.

### Transformational methods and their application to complexity problems

- Computer ScienceActa Informatica
- 1976

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.