Home Catalogue search

eng

Refine your search:

Search in the Catalogues and Directories






	Sort by
Simple Search

Page: 1 2

Hits 1 – 20 of 25

1	Experiments in Grammatical Inference.
	Cook,Craig M.
	In: DTIC AND NTIS (1973)
	BASE
	Show details

2	On Syntactic Pattern Recognition and Stochastic Languages.
	Fu,K. S.
	In: DTIC AND NTIS (1971)
	BASE
	Show details

3	Tree Automata and Adjunct Grammars.
	Levy,Leon S.
	In: DTIC AND NTIS (1971)
	BASE
	Show details

4	Stochastic Automata, Stochastic Languages, and Pattern Recognition
	Fu,K. S.
	In: DTIC AND NTIS (1970)
	BASE
	Show details

5	THEORIES OF COMPUTATION.
	Rabin,M. O.
	In: DTIC AND NTIS (1970)
	BASE
	Show details

6	PRACTICAL TRANSLATORS FOR LR(k) LANGUAGES.
	DeRemer,Franklin Lewis
	In: DTIC AND NTIS (1969)
	BASE
	Show details

7	LINGUISTIC SPECIFICATION AND ANALYSIS OF CLASSES OF LINE PATTERNS.
	Feder,Jerome
	In: DTIC AND NTIS (1969)
	BASE
	Show details

8	NOTE ON FUZZY LANGUAGES.
	Lee,E. T.; Zadeh,L. A.
	In: DTIC AND NTIS (1969)
	BASE
	Show details

9	FULL AFLS AND NESTED ITERATED SUBSTITUTION
	Greibach,Sheila A.
	In: DTIC AND NTIS (1969)
	BASE
	Show details

10	CHAINS OF FULL AFLS
	Greibach, Sheila A
	In: DTIC AND NTIS (1969)
	BASE
	Show details

11	ON THE CLOSURE OF AFL UNDER REVERSAL
	Ginsburg, Seymour; Harrison, Michael
	In: DTIC AND NTIS (1969)
	BASE
	Show details

12	CHECKING AUTOMATA AND ONE-WAY STACK LANGUAGES
	Greibach,Sheila
	In: DTIC AND NTIS (1968)
	BASE
	Show details

13	ABSTRACT FAMILIES OF LANGUAGES
	Ginsburg,Seymour; Greibach,Sheila
	In: DTIC AND NTIS (1968)
	Abstract: The notion of an abstract family of language (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) ; See also Scientific-18, 672 970.
	Keyword: LANGUAGE; PROGRAMMING LANGUAGES; ABSTRACT FAMILIES OF ACCEPTORS; ABSTRACT FAMILIES OF LANGUAGES; ABSTRACT FAMILIES OF TRANSDUCERS; ARTIFICIAL INTELLIGENCE; AUTOMATA; Computer Programming and Software; CONTEXT FREE GRAMMARS; FINITE STATE MACHINES; LEARNING MACHINES; Linguistics; SET THEORY; THEOREMS; TURING MACHINES
	URL: http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=AD0672971 http://www.dtic.mil/docs/citations/AD0672971
	BASE
	Hide details

14	ON MATHEMATICAL RESEARCH FOR ARTIFICIAL INTELLIGENCE
	Schutzenberger,Marco P.
	In: DTIC AND NTIS (1968)
	BASE
	Show details

15	INTERCALATION THEOREMS FOR PUSHDOWN STORE AND STACK LANGUAGES
	Ogden,William Frederick
	In: DTIC AND NTIS (1968)
	BASE
	Show details

16	SELECTED TOPICS IN AUTOMATA THEORY.
	Karp,Richard M.
	In: DTIC AND NTIS (1968)
	BASE
	Show details

17	A NOTE ON UNDECIDABLE PROPERTIES OF FORMAL LANGUAGES
	Greibach,Sheila
	In: DTIC AND NTIS (1967)
	BASE
	Show details

18	CONTROL SETS ON GRAMMARS.
	Ginsburg,Seymour; Spanier,Edwin H.
	In: DTIC AND NTIS (1967)
	BASE
	Show details

19	TREE ACCEPTORS AND SOME OF THEIR APPLICATIONS
	Doner, John
	In: DTIC AND NTIS (1967)
	BASE
	Show details

20	PRE-AFL (ABSTRACT FAMILY OF LANGUAGES).
	Ginsburg,Seymour; Greibach,Sheila; Hopcroft,John
	In: DTIC AND NTIS (1967)
	BASE
	Show details

Page: 1 2

© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern