Ginsburg, Seymour 1927
Overview
Works:  45 works in 139 publications in 6 languages and 1,836 library holdings 

Roles:  Author 
Publication Timeline
.
Most widely held works by
Seymour Ginsburg
The mathematical theory of context free languages by
Seymour Ginsburg(
Book
)
30 editions published between 1966 and 1994 in 3 languages and held by 682 WorldCat member libraries worldwide
30 editions published between 1966 and 1994 in 3 languages and held by 682 WorldCat member libraries worldwide
An introduction to mathematical machine theory by
Seymour Ginsburg(
Book
)
16 editions published between 1962 and 1971 in 4 languages and held by 430 WorldCat member libraries worldwide
16 editions published between 1962 and 1971 in 4 languages and held by 430 WorldCat member libraries worldwide
Algebraic and automatatheoretic properties of formal languages by
Seymour Ginsburg(
Book
)
14 editions published between 1975 and 1994 in English and Italian and held by 380 WorldCat member libraries worldwide
14 editions published between 1975 and 1994 in English and Italian and held by 380 WorldCat member libraries worldwide
Studies in abstract families of languages by
Seymour Ginsburg(
Book
)
15 editions published between 1969 and 1983 in English and held by 213 WorldCat member libraries worldwide
15 editions published between 1969 and 1983 in English and held by 213 WorldCat member libraries worldwide
Algebraic and automatatheoretic properties of formal languages by
Seymour Ginsburg(
Book
)
4 editions published in 1975 in English and Undetermined and held by 13 WorldCat member libraries worldwide
4 editions published in 1975 in English and Undetermined and held by 13 WorldCat member libraries worldwide
Principal AFL by
Seymour Ginsburg(
Book
)
3 editions published between 1969 and 1970 in English and held by 6 WorldCat member libraries worldwide
A (full) principal abstract family of languages(AFL) is a (full) AFL generated by a single language, i.e., it is the smallest (full) AFL containing the given language. In the present paper, a study is made of such AFL. First, an AFA (abstract family of acceptors) characterization of (full) principal AFL is given. From this result, many wellknown families of AFL can be shown to be (full) principal AFL. Next, a representation theorem for each language in a (full) principal AFL is given involving the generator and one application each of concatenation, star, intersection with a regular set, inverse homomorphism, and a special type of homomorphism. Finally, it is shown that if LL1 and LL2 are (full) principal AFL, then so are (a) the smallest (full) AFL containing (the intersection of L1 and L2/L1 in LL1, L2 in LL2) and (b) the family obtained by substituting epsilonfree languages of LL2 into languages of LL1. (Author)
3 editions published between 1969 and 1970 in English and held by 6 WorldCat member libraries worldwide
A (full) principal abstract family of languages(AFL) is a (full) AFL generated by a single language, i.e., it is the smallest (full) AFL containing the given language. In the present paper, a study is made of such AFL. First, an AFA (abstract family of acceptors) characterization of (full) principal AFL is given. From this result, many wellknown families of AFL can be shown to be (full) principal AFL. Next, a representation theorem for each language in a (full) principal AFL is given involving the generator and one application each of concatenation, star, intersection with a regular set, inverse homomorphism, and a special type of homomorphism. Finally, it is shown that if LL1 and LL2 are (full) principal AFL, then so are (a) the smallest (full) AFL containing (the intersection of L1 and L2/L1 in LL1, L2 in LL2) and (b) the family obtained by substituting epsilonfree languages of LL2 into languages of LL1. (Author)
Abstract families of languages by
Seymour Ginsburg(
Book
)
5 editions published between 1967 and 1968 in English and held by 6 WorldCat member libraries worldwide
The notion of an abstract family of languages (AFL) as a family of sets of words satisfying certain properties common to many types of formal languages is introduced. Operations preserving AFL are then considered. The concept of an abstract family of acceptors (AFA) is also introduced and shown to give rise to an AFL. A necessary and sufficient condition on an AFL is presented in order that the AFL come from some AFA. Finally, abstract families of transducers (AFA with output) are discussed. (Author)
5 editions published between 1967 and 1968 in English and held by 6 WorldCat member libraries worldwide
The notion of an abstract family of languages (AFL) as a family of sets of words satisfying certain properties common to many types of formal languages is introduced. Operations preserving AFL are then considered. The concept of an abstract family of acceptors (AFA) is also introduced and shown to give rise to an AFL. A necessary and sufficient condition on an AFL is presented in order that the AFL come from some AFA. Finally, abstract families of transducers (AFA with output) are discussed. (Author)
A mathematical model of transformational grammars by
Seymour Ginsburg(
Book
)
5 editions published in 1968 in English and held by 5 WorldCat member libraries worldwide
A mathematical model of transformational grammars is presented which incorporates most current versions. Among other things, the model has a formal definition of transformations and a general scheme for ordering them. Numerous examples are given to illustrate the theory. (Author)
5 editions published in 1968 in English and held by 5 WorldCat member libraries worldwide
A mathematical model of transformational grammars is presented which incorporates most current versions. Among other things, the model has a formal definition of transformations and a general scheme for ordering them. Numerous examples are given to illustrate the theory. (Author)
ALGORITHMIC LANGUAGES PROJECT(
Book
)
4 editions published between 1965 and 1969 in English and held by 4 WorldCat member libraries worldwide
The purpose of this report is to review and summarize the results presented in eleven scientific reports during the contract period. Reports the purpose of the investigation was to accomplish the following: (1) Conduct research designed to develop a theory for algorithmic (programming languages). (2) Develop suitable mathematical models of currently used mathematical language such as ALGOL, COBOL, and JOVIAL. (3) Use the mathematical models to answer questions of interest about these languages. (Author)
4 editions published between 1965 and 1969 in English and held by 4 WorldCat member libraries worldwide
The purpose of this report is to review and summarize the results presented in eleven scientific reports during the contract period. Reports the purpose of the investigation was to accomplish the following: (1) Conduct research designed to develop a theory for algorithmic (programming languages). (2) Develop suitable mathematical models of currently used mathematical language such as ALGOL, COBOL, and JOVIAL. (3) Use the mathematical models to answer questions of interest about these languages. (Author)
Finiteturn pushdown automata by
Seymour Ginsburg(
Book
)
2 editions published in 1965 in English and held by 3 WorldCat member libraries worldwide
A finiteturn pda is a pda in which the length of the pushdown tape alternatively increases and decreases at most a fixed bounded number of times during any sweep of the automation. This paper is a study of these finiteturn pda and the context free languages they recognize. These context free languages are characterized both in terms of grammars (two ways) and in terms of generation from finite sets by three operations. A decision procedure is given for determining if an arbitrary pda is a finiteturn pda. There is no decision procedure for determining if an arbitrary context free language is accepted by some finiteturn pda. (Author)
2 editions published in 1965 in English and held by 3 WorldCat member libraries worldwide
A finiteturn pda is a pda in which the length of the pushdown tape alternatively increases and decreases at most a fixed bounded number of times during any sweep of the automation. This paper is a study of these finiteturn pda and the context free languages they recognize. These context free languages are characterized both in terms of grammars (two ways) and in terms of generation from finite sets by three operations. A decision procedure is given for determining if an arbitrary pda is a finiteturn pda. There is no decision procedure for determining if an arbitrary context free language is accepted by some finiteturn pda. (Author)
DERIVATIONBOUNDED LANGUAGES by
Seymour Ginsburg(
Book
)
2 editions published in 1968 in English and held by 2 WorldCat member libraries worldwide
A derivation is a phrasestructure grammar is said to be kbounded if each word in the derivation contains at most k occurrences of nonterminals. A set L is said to be derivation bounded if there exists a phrasestructure grammar G and a positive inter k such that L is the set of words in the language generated by G which have some kbounded derivation. The main result is that every derivationbounded set is a contextfree language. Various characterizations of the derivationbounded languages are then given. For example, the derivationbounded languages coincide with the standard matchingchoice sets discussed by Yntema. They also coincide with the smallest family of sets containing the linear context free languages and closed under arbitrary substitution. (Author)
2 editions published in 1968 in English and held by 2 WorldCat member libraries worldwide
A derivation is a phrasestructure grammar is said to be kbounded if each word in the derivation contains at most k occurrences of nonterminals. A set L is said to be derivation bounded if there exists a phrasestructure grammar G and a positive inter k such that L is the set of words in the language generated by G which have some kbounded derivation. The main result is that every derivationbounded set is a contextfree language. Various characterizations of the derivationbounded languages are then given. For example, the derivationbounded languages coincide with the standard matchingchoice sets discussed by Yntema. They also coincide with the smallest family of sets containing the linear context free languages and closed under arbitrary substitution. (Author)
TWOWAY BALLOON AUTOMATA AND AFL by
Seymour Ginsburg(
Book
)
2 editions published in 1968 in English and held by 2 WorldCat member libraries worldwide
It is shown that if the family of languages accepted by a closed class of twoway balloon automata is closed under lengthpreserving homomorphism, then this family is an AFL closed under intersection and efree substitution. It is then proved that the family of languages accepted by the closed class of twoway balloon automata of (nonerasing) (deterministic) stack acceptors is such a family. (Author)
2 editions published in 1968 in English and held by 2 WorldCat member libraries worldwide
It is shown that if the family of languages accepted by a closed class of twoway balloon automata is closed under lengthpreserving homomorphism, then this family is an AFL closed under intersection and efree substitution. It is then proved that the family of languages accepted by the closed class of twoway balloon automata of (nonerasing) (deterministic) stack acceptors is such a family. (Author)
ONEWAY REALTIME LISTSTORAGE LANGUAGES by
Seymour Ginsburg(
Book
)
2 editions published in 1967 in English and held by 2 WorldCat member libraries worldwide
A device is presented which has its memory organized as a list. Attention is then focused on the automaton (called an lsa) which results when the input is read oneway and the device operates in real time. The set of words (called a language) accepted by an lsa is extensively studied. In particular, several characteristics and closure properties of languages are given. (Author)
2 editions published in 1967 in English and held by 2 WorldCat member libraries worldwide
A device is presented which has its memory organized as a list. Attention is then focused on the automaton (called an lsa) which results when the input is read oneway and the device operates in real time. The set of words (called a language) accepted by an lsa is extensively studied. In particular, several characteristics and closure properties of languages are given. (Author)
Algebraie and automatatheoretic prosperties of formal languages by
Seymour Ginsburg(
Book
)
1 edition published in 1975 in Dutch and held by 2 WorldCat member libraries worldwide
1 edition published in 1975 in Dutch and held by 2 WorldCat member libraries worldwide
SUBSTITUTION IN FAMILIES OF LANGUAGES(
Book
)
1 edition published in 1968 in English and held by 2 WorldCat member libraries worldwide
The effect of substitution in families of languages, especially AFL, is considered. Among the main results shown are the following: The substitution of one AFL into another is an AFL. Under suitable hypotheses, the AFL generated by the family obtained from the substitution of one family into another, is the family obtained from the substitution of the corresponding AFL. A condition is given for the AFL generated by the substitution closure of a family to be the substitution closure of the AFL generated by the family. (Author)
1 edition published in 1968 in English and held by 2 WorldCat member libraries worldwide
The effect of substitution in families of languages, especially AFL, is considered. Among the main results shown are the following: The substitution of one AFL into another is an AFL. Under suitable hypotheses, the AFL generated by the family obtained from the substitution of one family into another, is the family obtained from the substitution of the corresponding AFL. A condition is given for the AFL generated by the substitution closure of a family to be the substitution closure of the AFL generated by the family. (Author)
Mappings which preserve context sensitive languages(
Book
)
1 edition published in 1965 in English and held by 2 WorldCat member libraries worldwide
A basic result which gives a condition under which a (possibly lengthdecreasing) homomorphism preserves a context sensitive language is presented. Using this result, conditions under which pushdown transducers and linear bounded transducers preserve context sensitive languages are given. The basic result is also applied to show that certain rewriting systems generate context sensitive languages instead of arbitrary recursively enumerable sets. Of special interest is the result that if each rule in a rewriting system has a terminal letter of its right side, then the language generated is context free. (Author)
1 edition published in 1965 in English and held by 2 WorldCat member libraries worldwide
A basic result which gives a condition under which a (possibly lengthdecreasing) homomorphism preserves a context sensitive language is presented. Using this result, conditions under which pushdown transducers and linear bounded transducers preserve context sensitive languages are given. The basic result is also applied to show that certain rewriting systems generate context sensitive languages instead of arbitrary recursively enumerable sets. Of special interest is the result that if each rule in a rewriting system has a terminal letter of its right side, then the language generated is context free. (Author)
Stack automata and compiling(
Book
)
1 edition published in 1965 in English and held by 2 WorldCat member libraries worldwide
Compilation consists of two parts, recognition and translation. A mathematical model is presented which embodies the salient features of many modern compiling techniques. The model, called the stack automaton, has the desirable feature of being deterministic in nature. This deterministic device is generalized to a nondeterministic device (nondeterministic stack automaton) and particular instances of this more general device noted. Sets accepted by nondeterministic stack automata are recursive. Each set accepted by a deterministic linear bounded automaton is accepted by some nonerasing stack automaton. Each context sensitive language is accepted by some (deterministic) stack automaton. (Author)
1 edition published in 1965 in English and held by 2 WorldCat member libraries worldwide
Compilation consists of two parts, recognition and translation. A mathematical model is presented which embodies the salient features of many modern compiling techniques. The model, called the stack automaton, has the desirable feature of being deterministic in nature. This deterministic device is generalized to a nondeterministic device (nondeterministic stack automaton) and particular instances of this more general device noted. Sets accepted by nondeterministic stack automata are recursive. Each set accepted by a deterministic linear bounded automaton is accepted by some nonerasing stack automaton. Each context sensitive language is accepted by some (deterministic) stack automaton. (Author)
Control sets on grammars by
Seymour Ginsburg(
Book
)
2 editions published in 1967 in English and held by 2 WorldCat member libraries worldwide
Given a set C of strings of rewriting rules of a phrase structure grammar G, we consider the set LC(G) of those words generated by leftmost derivations in G whose corresponding string of rewriting rules is an element of C. The paper concerns the nature of the set LC(G) when C and G are assumed to have special form. For example, for G an arbitrary phase structure grammar, LC(G) is an abstract family of languages if C is an abstract family of languages, and LC(G) is bounded if C is bounded. (Author)
2 editions published in 1967 in English and held by 2 WorldCat member libraries worldwide
Given a set C of strings of rewriting rules of a phrase structure grammar G, we consider the set LC(G) of those words generated by leftmost derivations in G whose corresponding string of rewriting rules is an element of C. The paper concerns the nature of the set LC(G) when C and G are assumed to have special form. For example, for G an arbitrary phase structure grammar, LC(G) is an abstract family of languages if C is an abstract family of languages, and LC(G) is bounded if C is bounded. (Author)
MULTISTACKCOUNTER LANGUAGES(
Book
)
1 edition published in 1970 in English and held by 2 WorldCat member libraries worldwide
A stackcounter acceptor is a stack acceptor in which the storage alphabet is just one letter. The present paper discusses multistackcounter acceptors operating in quasirealtime, i.e., acceptors in which each storage tape is a stack counter and in which there are only a bounded number of consecutive Emoves. It is shown that the quasirealtime kstackcounter acceptor is equivalent to one operating in nondeterministic realtime. Lastly, it is shown that acceptance by final state of a kstackcounter acceptor is equivalent to acceptance by empty tape and final state. (Author)
1 edition published in 1970 in English and held by 2 WorldCat member libraries worldwide
A stackcounter acceptor is a stack acceptor in which the storage alphabet is just one letter. The present paper discusses multistackcounter acceptors operating in quasirealtime, i.e., acceptors in which each storage tape is a stack counter and in which there are only a bounded number of consecutive Emoves. It is shown that the quasirealtime kstackcounter acceptor is equivalent to one operating in nondeterministic realtime. Lastly, it is shown that acceptance by final state of a kstackcounter acceptor is equivalent to acceptance by empty tape and final state. (Author)
Some remarks about sequences in context free languages by
Seymour Ginsburg(
Book
)
2 editions published in 1963 in English and held by 1 WorldCat member library worldwide
2 editions published in 1963 in English and held by 1 WorldCat member library worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Useful Links
Associated Subjects
Computational linguistics Computer inputoutput equipment Computer programming Computer software Electronic data processing English languageGrammar, Generative Formal languages Generative grammar Language and languages Linguistics Machine theory Mathematical linguistics Programming languages (Electronic computers) Realtime control Realtime data processing Realtime programming Robots Sequential machine theory
Alternative Names
Ginsburg, S.
Ginzburg, Sejmur.
Ginzburg, Sejmur 19272004
Ginzburg, Sejmur 19282004
Seymour Ginsburg American computer scientist
Seymour Ginsburg Amerikaans informaticus (19282004)
Seymour Ginsburg amerikansk datavetare
Seymour Ginsburg amerikansk informatikar
Seymour Ginsburg amerikansk informatiker
Seymour Ginsburg informaticien américain
Seymour Ginsburg USamerikanischer Informatiker
Гинсбург, Сеймур 1927
Гинсбург, Сеймур, 19272004
ギンスバーグ, シーモア
Languages