A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Formal translations and Szilard languages
1976
Information and Control
Preserved Fulltext
As a by-product, it is established that the containment problem for Szitard languages is decidable. ...
One of the methods for defining translations is the so called syntax-directed translation scheme which can be interpreted as a pair of rather similar grammars with the productions working in parallel. ...
A (formal) translation T is a set of pairs (x, x') of words x and x' over some alphabets 27 and 27'. ...
doi:10.1016/s0019-9958(76)90341-7
fatcat:gp3msjpstjdcbchkjp6f5qvuay
Formal translations and the containment problem for Szilard languages
[chapter]
1975
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
As a by-product, i t is established that the containment problem for Szilard languages is decidable. ...
One of the methods used for defining translations is the socalled syntax-directed translation scheme which can be interpreted as a pair of rather similar grammars with the productions working in parallel ...
In an earlier report by KRIEGEL and MAURER (1974) i t has been shown that this " f i t t i n g problem" and the equivalent containment problem for Szilard languages are decidable. ...
doi:10.1007/3-540-07407-4_25
fatcat:yfwrxhy3bzhdhayy37hknticjq
Page 2257 of Mathematical Reviews Vol. 52, Issue 6
[page]
1976
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
A. 16153
Formal translations and Szilard languages.
Information and Control 30 (1976), no. 2, 187-198. ...
Stockii (Moscow)
De Luca, A. 16156 On the entropy of a formal language.
Automata theory and formal languages (Second GI Conf.,
Kaiserslautern, 1975), pp. 103-109. Lecture Notes in Comput. ...
Page 4811 of Mathematical Reviews Vol. , Issue 86j
[page]
1986
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Szilard languages have interesting language-theoretic properties, and they are also closely related with the theory of translation. ...
A modularization mechanism M is formalized as M = (D, Spc), where D is a declaration mecha- nism and Spc is a specification language. ...
Page 2783 of Mathematical Reviews Vol. , Issue 80G
[page]
1980
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
*Formale Sprachen. Translated from the English by E.-W. Dieterich.
Springer-Verlag, Berlin-New York, 1978. xi+314 pp. $26.40. ...
.; Specht, J. 80g:68094
Szilard languages of 1O-grammars.
Inform. and Control 40 (1979), no. 3, 319-331.
Authors’ summary: “We investigate Szilard languages of IO-gram- mars. ...
Page 2133 of Mathematical Reviews Vol. , Issue 83e
[page]
1983
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Authors’ summary: “We characterize the images of Szilard languages under decreasing homomorphisms using so-called label grammars and show that each A-free label language is in fact the coding of some Szilard ...
The aim of this paper is to introduce some basic notions and formalisms concerning our approach, to illustrate it by examples and to compare several classes of graph-generating systems that we introduce ...
Page 260 of Mathematical Reviews Vol. , Issue 85a
[page]
1985
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
With this aim we investi- gate the Parikh images and the size of the classes of homomorphic images of Szilard languages as well as the closure properties of such families.” ...
., put into reduced form, without modifying their translations. This is shown first for noncircular AGs and then for arbitrary AGs. ...
Page 2033 of Mathematical Reviews Vol. 54, Issue 6
[page]
1977
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
.; Mandrioli, D. 14449
Petri nets and Szilard languages.
Information and Control 33 (1977), no. 2, 177-192. ...
“Nauka”, Moscow, 1969; MR 43 #1777; the author, Formal grammars and languages, Izdat. “Nauka”, Moscow, 1973; MR 50 #6214]. ...
Page 1899 of Mathematical Reviews Vol. 57, Issue 5
[page]
1979
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
.; Wood, Derick Szilard languages of L-systems. Automata, languages, development, pp. 251-261. North-Holland, Amsterdam, 1976. ...
In
Particular, the families of Szilard languages of ETIL and ETIL
systems turn out to be intersection-closed AFL’s.
{For the entire collection see MR 56 #10156.} ...
Cumulative subject index volumes 30–32
1976
Information and Control
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
, 32, 201
/' Systems
iterated a-NGSM
maps and, 32, I
Szilard languages
formal translations, 30, 187
T
Tessellation automata
injectivity of global maps for, 32, 158
Topology
for automata, 32 ...
, 32, 379
Translations
formal, Szilard languages, 30, 187
Trinomials
generation of irreducible polynomials
from, 30, 396
V
Variable length codes
characterizations, 32, 263
Varying systems
slow ...
doi:10.1016/s0019-9958(76)90300-4
fatcat:6uhmar7mq5bq3emjcviioes64a
Page 464 of Mathematical Reviews Vol. , Issue 89A
[page]
1989
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
-E. * Varieties of formal languages. With a preface by M.-P. Schiitzenberger. Translated from the French by A. Howie. Foundations of Computer Science. ...
Rela- tions between Szilard languages of pure context-free grammars and those of ordinary context-free grammars are studied, and hierar- chies of Szilard languages of pure context-free grammars based on ...
Page 3635 of Mathematical Reviews Vol. , Issue 85h
[page]
1985
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
This paper consists of straight-
forward results and examples on the properties of left Szilard languages. ...
We discuss edge gram- mars in the formal language theory context and give conditions under which some graph families defined by edge grammars are self-embedding or contractible. ...
Page 5116 of Mathematical Reviews Vol. , Issue 911
[page]
1991
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Definite clause translation grammars and their applications. Chapter 10. Further expressive power—discontinuous grammars. Chapter 11. Other formalisms. Chapter 12. Bottom up parsing. Chapter 13. ...
Necessary and suf- ficient conditions are given for the Szilard language of a breadth- first context-free grammar to be regular and context-free. ...
Page 1375 of Mathematical Reviews Vol. 52, Issue 4
[page]
1976
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Kriegel and H. A. Maurer, Formal translations and the containment problem for Szilard languages (pp. 233-238); Antonio Restivo, A charac- terization of bounded regular sets (pp. 239-244); E. ...
Book, Formal language theory and theoretical computer science (pp. 1-15); L. Boasson and M. Nivat, Le cylindre des langages linéaires n’est pas principal (pp. 16-19); J.-F. Perrot and J. ...
Page 766 of Mathematical Reviews Vol. , Issue 80B
[page]
1980
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The author proposes a formalism for denoting several families of languages which can be constructed using closure operators, such as finite state translation, the Kleene operators (union, concatena- tion ...
The author discusses so-called decomposition translations which
are generalisations of syntax-directed translations in the sense of
Aho and Ullman. ...
« Previous
Showing results 1 — 15 out of 365 results