A Note on Cycle Grammars.

Abstract

Grammars whose languages consist of cycles (necklaces) rather than strings are considered. If G is context free, and if one regards G as generating cycles instead of strings, the resulting language is just what one would get if he bent the strings of L(G) into cycles. This is no longer true if G is context sensitive. However, in this case too, the context-sensitive cycle languages are just the bendings of the context-sensitive string languages. Automata on cyclic tapes are also discussed.

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1974
Accession Number
AD0780411

Entities

People

  • Azriel Rosenfeld

Organizations

  • University of Maryland

Tags

DTIC Thesaurus Topics

  • Automata
  • Grammars
  • Language
  • Linguistics

Readers

  • Computational Linguistics
  • Computer Programming and Software Development.
  • Mathematical Modeling and Probability Theory.