標(biāo)題: Titlebook: An Introduction to Formal Language Theory; Robert N. Moll,Michael A. Arbib,A. J. Kfoury Textbook 1988 Springer-Verlag New York Inc. 1988 N [打印本頁(yè)] 作者: Conjecture 時(shí)間: 2025-3-21 17:14
書(shū)目名稱(chēng)An Introduction to Formal Language Theory影響因子(影響力)
書(shū)目名稱(chēng)An Introduction to Formal Language Theory影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)An Introduction to Formal Language Theory網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)An Introduction to Formal Language Theory網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)An Introduction to Formal Language Theory被引頻次
書(shū)目名稱(chēng)An Introduction to Formal Language Theory被引頻次學(xué)科排名
書(shū)目名稱(chēng)An Introduction to Formal Language Theory年度引用
書(shū)目名稱(chēng)An Introduction to Formal Language Theory年度引用學(xué)科排名
書(shū)目名稱(chēng)An Introduction to Formal Language Theory讀者反饋
書(shū)目名稱(chēng)An Introduction to Formal Language Theory讀者反饋學(xué)科排名
作者: Aboveboard 時(shí)間: 2025-3-21 21:46
Evaluation: Wege aus der Krise,characterization of natural language, demonstrated that context-free grammars are reasonably adequate systems for describing the basic syntax of many programming languages. We will also study some issues in natural language processing, given the increasing importance of computational linguistics in 作者: exigent 時(shí)間: 2025-3-22 02:20 作者: puzzle 時(shí)間: 2025-3-22 07:12
0172-603X of human languages) and within artificial intelligence. The present volume is the first textbook to combine the topics of formal language theory traditionally 978-1-4613-9597-3978-1-4613-9595-9Series ISSN 0172-603X Series E-ISSN 2512-5486 作者: Acetaldehyde 時(shí)間: 2025-3-22 11:59 作者: sparse 時(shí)間: 2025-3-22 15:04
978-1-4613-9597-3Springer-Verlag New York Inc. 1988作者: oncologist 時(shí)間: 2025-3-22 21:04 作者: 去掉 時(shí)間: 2025-3-22 22:14
Das Sterilisieren der Tabletten,nly if some push-down automaton can accept the language in a sense we shall shortly make precise. This result has practical as well as theoretical importance, because a push-down store is the basis for several algorithms used in parsing context-free languages.作者: aggrieve 時(shí)間: 2025-3-23 04:24
https://doi.org/10.1007/978-3-7091-5546-2trong .(1), are easy to parse and easy to write parsers for. In addition, many important programming language fragments can be given a strong .(1) description, so parsing based on this grammatical characteristic has important applications in computer science.作者: Conquest 時(shí)間: 2025-3-23 08:23 作者: 不要嚴(yán)酷 時(shí)間: 2025-3-23 13:27
Tabletten, Begriff und Benennung,In this chapter and in Chapter 7 we consider parsing, which has been the principal application of formal language theory to computer science. In compiler theory, parsing a string of terminal symbols generally means supplying a derivation tree for the string.作者: glomeruli 時(shí)間: 2025-3-23 14:32
Grammars and Machines,In Chapter 1 we had a first look at context-free grammars and context-free languages, and we had a glimpse at two areas of practical interest—parsing and natural language processing—where formal grammatical descriptions play an important role.作者: Detoxification 時(shí)間: 2025-3-23 21:00
Parsing, Part I,In this chapter and in Chapter 7 we consider parsing, which has been the principal application of formal language theory to computer science. In compiler theory, parsing a string of terminal symbols generally means supplying a derivation tree for the string.作者: 解脫 時(shí)間: 2025-3-24 02:03
Push-Down Automata and Context-Free Grammars,nly if some push-down automaton can accept the language in a sense we shall shortly make precise. This result has practical as well as theoretical importance, because a push-down store is the basis for several algorithms used in parsing context-free languages.作者: 玉米 時(shí)間: 2025-3-24 05:29 作者: 死亡率 時(shí)間: 2025-3-24 09:53 作者: Soliloquy 時(shí)間: 2025-3-24 13:45 作者: modest 時(shí)間: 2025-3-24 17:56
Das Sterilisieren der Tabletten,nly if some push-down automaton can accept the language in a sense we shall shortly make precise. This result has practical as well as theoretical importance, because a push-down store is the basis for several algorithms used in parsing context-free languages.作者: dandruff 時(shí)間: 2025-3-24 20:00 作者: Heart-Rate 時(shí)間: 2025-3-25 02:49 作者: 土坯 時(shí)間: 2025-3-25 05:33
https://doi.org/10.1007/978-3-7091-5546-2trong .(1), are easy to parse and easy to write parsers for. In addition, many important programming language fragments can be given a strong .(1) description, so parsing based on this grammatical characteristic has important applications in computer science.作者: 膝蓋 時(shí)間: 2025-3-25 09:10
Die wissenschaftliche Methode der Reaktion,l languages, the languages of everyday human usage. In this chapter and the next we will explore in more detail just what formal power natural languages seem to have, and how this is captured in contemporary linguistic theories. We will see that there is no easy answer to the question, What is the g作者: 外科醫(yī)生 時(shí)間: 2025-3-25 14:18 作者: tenosynovitis 時(shí)間: 2025-3-25 17:34 作者: ventilate 時(shí)間: 2025-3-25 21:45 作者: RENAL 時(shí)間: 2025-3-26 01:45
0172-603X the main reasons for this centrality were connected with the specification and analy- sis of programming languages, which led naturally to the following ques- tions. How might a grammar be written for such a language? How could we check whether a text were or were not a well-formed program generate作者: COW 時(shí)間: 2025-3-26 06:20 作者: GLADE 時(shí)間: 2025-3-26 08:36
Die wissenschaftliche Methode der Reaktion,es seem to have, and how this is captured in contemporary linguistic theories. We will see that there is no easy answer to the question, What is the generative power of natural languages? There is still some disagreement, in fact, over whether natural languages are recursive or not.作者: Countermand 時(shí)間: 2025-3-26 13:10
https://doi.org/10.1007/978-3-663-13507-4will examine two in detail. First, however, in 9.1 we will review some current developments in linguistic theory that are common to both approaches to be examined. Then, in Section 9.2 we describe the framework of generalized phrase . (GPSG). Finally, in Section 9.3 we look at the theory of . (GB), the current version of transformational grammar.作者: 牙齒 時(shí)間: 2025-3-26 20:12 作者: 2否定 時(shí)間: 2025-3-26 22:26 作者: anniversary 時(shí)間: 2025-3-27 02:29 作者: Magnitude 時(shí)間: 2025-3-27 06:18
Turing Machines and Language Theory,algorithm, real or imagined. Actually, Turing showed only that these problems are not calculable specifically by Turing machines; later investigations by other researchers led to the generally held belief that Turing computability is synonymous with computability in any other sufficiently powerful algorithm specification system.作者: Rotator-Cuff 時(shí)間: 2025-3-27 12:24 作者: 抱怨 時(shí)間: 2025-3-27 15:41
Push-Down Automata and Context-Free Grammars,nly if some push-down automaton can accept the language in a sense we shall shortly make precise. This result has practical as well as theoretical importance, because a push-down store is the basis for several algorithms used in parsing context-free languages.作者: ineluctable 時(shí)間: 2025-3-27 21:39 作者: 嚴(yán)厲譴責(zé) 時(shí)間: 2025-3-27 23:04 作者: 遺傳 時(shí)間: 2025-3-28 03:15
Parsing, Part II,trong .(1), are easy to parse and easy to write parsers for. In addition, many important programming language fragments can be given a strong .(1) description, so parsing based on this grammatical characteristic has important applications in computer science.作者: incision 時(shí)間: 2025-3-28 06:56
The Formal Description of Natural Languages,l languages, the languages of everyday human usage. In this chapter and the next we will explore in more detail just what formal power natural languages seem to have, and how this is captured in contemporary linguistic theories. We will see that there is no easy answer to the question, What is the g作者: 敲詐 時(shí)間: 2025-3-28 14:29 作者: Redundant 時(shí)間: 2025-3-28 15:12
9樓作者: admission 時(shí)間: 2025-3-28 22:47
9樓作者: nerve-sparing 時(shí)間: 2025-3-29 02:47
10樓作者: modest 時(shí)間: 2025-3-29 05:51
10樓作者: choroid 時(shí)間: 2025-3-29 07:26
10樓作者: medium 時(shí)間: 2025-3-29 14:04
10樓
