#### Filter Results:

- Full text PDF available (0)

#### Publication Year

1964

2000

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Karel Culik, Rina S. Cohen
- J. Comput. Syst. Sci.
- 1971

- Rina S. Cohen, Janusz A. Brzozowski
- J. Comput. Syst. Sci.
- 1971

- Rina S. Cohen, Arie Y. Gold
- J. Comput. Syst. Sci.
- 1978

- Rina S. Cohen, Arie Y. Gold
- Theor. Comput. Sci.
- 1978

- S Weissman, R S Cohen
- Adolescent psychiatry
- 1985

- Rina S. Cohen, Arie Y. Gold
- J. Comput. Syst. Sci.
- 1977

An co-language is a set consis t ing of oJ-length s t r ings over some alphabet; an o)-automaton is a device capable of recognizing oMength i npu t tapes. T h i s paper in t roduces the basic not ions concern ing genera t ion of ~o-languages by m e a n s of oJ-grammars and their recognition by oJ-automata wi th var ious recognit ion modes . At ten t ion isā¦ (More)

- Rina S. Cohen
- Mathematical systems theory
- 1971

This paper deals with restricted star height of regular sets, as defined by L. C. Eggan. Theorems relating the star height of a regular event with the structure of the reduced deterministic automaton recognizing the event are presented. These theorems provide new techniques for establishing star height; in many cases the exact star height of the givenā¦ (More)

- Rina S. Cohen
- J. Comput. Syst. Sci.
- 1970

- Rina S. Cohen, Janusz A. Brzozowski
- J. Comput. Syst. Sci.
- 1970

- Janusz A. Brzozowski, Rina S. Cohen
- SWAT
- 1967

Decompositions of regular events into star events, i.e. events of the form <italic>W</italic> = <italic>V</italic>*, are studied. Mathematically, the structure of a star event is that of a monoid. First it is shown that every regular event contains a finite number of maximal star events, which are shown to be regular and can be effectively computed.ā¦ (More)