The characterization by automata of certain classes of languages in the context sensitive area

S. H. Von Solms

doi:10.1016/S0019-9958(75)90145-X

The characterization by automata of certain classes of languages in the context sensitive area

S. H. Von Solms

Academy of Computer Science and Software Engineering

Research output: Contribution to journal › Article › peer-review

9 Citations (Scopus)

Abstract

A new automaton, called a contraction automaton of complexity (n, k), n > 0, k > 1, is defined, and several well-known classes of formal languages, which had up to date only been characterized by grammars, are characterized by this new automaton.

Original language	English
Pages (from-to)	262-271
Number of pages	10
Journal	Information and control
Volume	27
Issue number	3
DOIs	https://doi.org/10.1016/S0019-9958(75)90145-X
Publication status	Published - Mar 1975

ASJC Scopus subject areas

General Engineering

Access to Document

10.1016/S0019-9958(75)90145-X

Cite this

@article{f72032a94d46496eb72db378c9d48afd,

title = "The characterization by automata of certain classes of languages in the context sensitive area",

abstract = "A new automaton, called a contraction automaton of complexity (n, k), n > 0, k > 1, is defined, and several well-known classes of formal languages, which had up to date only been characterized by grammars, are characterized by this new automaton.",

author = "{Von Solms}, {S. H.}",

year = "1975",

month = mar,

doi = "10.1016/S0019-9958(75)90145-X",

language = "English",

volume = "27",

pages = "262--271",

journal = "Information and control",

issn = "0019-9958",

publisher = "Elsevier Inc.",

number = "3",

}

TY - JOUR

T1 - The characterization by automata of certain classes of languages in the context sensitive area

AU - Von Solms, S. H.

PY - 1975/3

Y1 - 1975/3

N2 - A new automaton, called a contraction automaton of complexity (n, k), n > 0, k > 1, is defined, and several well-known classes of formal languages, which had up to date only been characterized by grammars, are characterized by this new automaton.

AB - A new automaton, called a contraction automaton of complexity (n, k), n > 0, k > 1, is defined, and several well-known classes of formal languages, which had up to date only been characterized by grammars, are characterized by this new automaton.

UR - http://www.scopus.com/inward/record.url?scp=0016483250&partnerID=8YFLogxK

U2 - 10.1016/S0019-9958(75)90145-X

DO - 10.1016/S0019-9958(75)90145-X

M3 - Article

AN - SCOPUS:0016483250

SN - 0019-9958

VL - 27

SP - 262

EP - 271

JO - Information and control

JF - Information and control

IS - 3

ER -

The characterization by automata of certain classes of languages in the context sensitive area

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this