DE eng

Search in the Catalogues and Directories

Page: 1...4 5 6 7 8 9
Hits 141 – 160 of 168

141
ABSTRACT FAMILIES OF LANGUAGES
In: DTIC AND NTIS (1967)
BASE
Show details
142
A NOTE ON PRESERVATION OF LANGUAGES BY TRANSDUCERS
In: DTIC AND NTIS (1967)
BASE
Show details
143
TREE ACCEPTORS AND SOME OF THEIR APPLICATIONS
In: DTIC AND NTIS (1967)
BASE
Show details
144
PRE-AFL (ABSTRACT FAMILY OF LANGUAGES).
In: DTIC AND NTIS (1967)
BASE
Show details
145
AN N2-RECOGNIZER FOR CONTEXT FREE GRAMMARS
In: DTIC AND NTIS (1967)
BASE
Show details
146
THE EQUIVALENCE OF CONTEXT LIMITED GRAMMARS TO CONTEXT FREE GRAMMARS
In: DTIC AND NTIS (1967)
BASE
Show details
147
DATA RETRIEVAL BY COMPUTER. A CRITICAL SURVEY.
In: DTIC AND NTIS (1966)
BASE
Show details
148
LANGUAGE AND AUTOMATA.
In: DTIC AND NTIS (1966)
BASE
Show details
149
A GENERALIZATION OF CONTEXT FREE DETERMINISM
In: DTIC AND NTIS (1966)
BASE
Show details
150
PARTIAL ALGORITHM PROBLEMS FOR CONTEXT FREE LANGUAGES
In: DTIC AND NTIS (1966)
BASE
Show details
151
BRACKETED CONTEXT FREE LANGUAGES.
In: DTIC AND NTIS (1966)
BASE
Show details
152
SOME OBSERVATIONS ON A TWO-DIMENSIONAL LANGUAGE.
In: DTIC AND NTIS (1965)
BASE
Show details
153
THE EQUIVALENCE OF CONTEXT-FREE PHRASE STRUCTURE GRAMMARS AND CATEGORIAL GRAMMARS.
In: DTIC AND NTIS (1965)
BASE
Show details
154
PUSHDOWN AUTOMATA WITH BOUNDED BACKTRACK
In: DTIC AND NTIS (1965)
BASE
Show details
155
FAILURE OF A CONJECTURE ABOUT CONTEXT FREE LANGUAGES
In: DTIC AND NTIS (1965)
BASE
Show details
156
DETERMINISTIC CONTEXT FREE LANGUAGES
In: DTIC AND NTIS (1965)
Abstract: A number of results about deterministic languages (languages accepted by pushdown automata with no choice of moves) are established. In particular, (1) each deterministic language is unambiguous. (2) the complement of each deterministic language is a deterministic language. (3) numerous operations which preserve deterministic languages (for example, intersection with a regular set) are obtained. (4) several problems are shown to be recursively unsolvable. (Author) ; Prepared in cooperation with Harvard Univ., Cambridge, Mass.
Keyword: *CONTEXT FREE GRAMMARS; ALGEBRA; AUTOMATA; Computer Hardware; Computer Programming and Software; Linguistics; MASS STORAGE; MATHEMATICAL LOGIC; PUSHDOWN STORAGE
URL: http://www.dtic.mil/docs/citations/AD0624938
http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=AD0624938
BASE
Hide details
157
THE UNSOLVABILITY OF THE RECOGNITION OF LINEAR CONTEXT-FREE LANGUAGES.
In: DTIC AND NTIS (1965)
BASE
Show details
158
ALGORITHMIC LANGUAGES PROJECT.
In: DTIC AND NTIS (1965)
BASE
Show details
159
FINITE-TURN PUSHDOWN AUTOMATA.
In: DTIC AND NTIS (1965)
BASE
Show details
160
Linguistics
Viertel, J. J.; Chomsky, A. Noam. - : Research Laboratory of Electronics (RLE) at the Massachusetts Institute of Technology (MIT), 1962
BASE
Show details

Page: 1...4 5 6 7 8 9

Catalogues
0
0
0
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
168
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern