標題: Titlebook: Automata, Languages and Programming; 2nd Colloquium, Univ Jacques Loeckx Conference proceedings 1974 Springer Berlin Heidelberg 1974 Automa [打印本頁] 作者: Impacted 時間: 2025-3-21 17:39
書目名稱Automata, Languages and Programming影響因子(影響力)
書目名稱Automata, Languages and Programming影響因子(影響力)學科排名
書目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開度
書目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開度學科排名
書目名稱Automata, Languages and Programming被引頻次
書目名稱Automata, Languages and Programming被引頻次學科排名
書目名稱Automata, Languages and Programming年度引用
書目名稱Automata, Languages and Programming年度引用學科排名
書目名稱Automata, Languages and Programming讀者反饋
書目名稱Automata, Languages and Programming讀者反饋學科排名
作者: Buttress 時間: 2025-3-21 23:01
https://doi.org/10.1007/3-211-29992-0tion diagram systems composed of such multiple exit diagrams can parse all deterministic context free languages. Further, LLP(k) parsers can be realized as directly executing (non-interpretive) subroutines. The method has been implemented [8]. The results demonstrate the feasibility of the approach.作者: 母豬 時間: 2025-3-22 03:55 作者: hypertension 時間: 2025-3-22 05:15 作者: BILE 時間: 2025-3-22 10:45 作者: liposuction 時間: 2025-3-22 13:43
On the Most Recent Property of ALGOL-Like Programsrams of a programming language; examples are given for BL in [5],p. 196, and for ALGOL 60 in [2], p. 108. In a main theorem McGowan gives sufficient compile time decidable conditions for the most recent correctness of a BL-program [S].作者: 不規(guī)則的跳動 時間: 2025-3-22 20:05
https://doi.org/10.1007/3-211-29992-0tants. Therefore, we introduce three types of dynamic programming schemata. Equivalence of schemata is defined and investigated, and necessary and sufficient conditions are given for the case of positively monotone interpretations.作者: constitutional 時間: 2025-3-23 00:32
Yang Sheng (Gesundheitspflege),rams of a programming language; examples are given for BL in [5],p. 196, and for ALGOL 60 in [2], p. 108. In a main theorem McGowan gives sufficient compile time decidable conditions for the most recent correctness of a BL-program [S].作者: Abominate 時間: 2025-3-23 03:29 作者: Charade 時間: 2025-3-23 06:55
https://doi.org/10.1007/3-211-29992-0e particularly significant in that they depend only on the semantics of the original algorithm, i.e., the input-output relations..To perform the parallelization (point 1), a new model of structured programming language is used, sufficiently general to ensure that every program can be automatically translated into a structured one.作者: Rinne-Test 時間: 2025-3-23 12:11
Vitalenergie (Qi) und Blut (Xue),on, we show that for every family of deterministic context-free pushdown parsers (e.g. precedence, LR(k), LL(k), ...) there is a family of general context-free parallel parsers that have the same efficiency in most practical cases (e.g. analysis of programming languages).作者: syncope 時間: 2025-3-23 14:21
Langages Sans Etiquettes et Transformations de Programmese départ à cette étude, nous ne chercherons pas à savoir si la structure de langage proposée ici s’y rattache. L’important est de montrer les possibilités qu’elle ouvre pour la manipulation formelle de programmes.作者: 斗爭 時間: 2025-3-23 20:02
Application of Church-Rosser Properties to Increase the Parallelism and Efficiency of Algorithmse particularly significant in that they depend only on the semantics of the original algorithm, i.e., the input-output relations..To perform the parallelization (point 1), a new model of structured programming language is used, sufficiently general to ensure that every program can be automatically translated into a structured one.作者: Semblance 時間: 2025-3-23 22:55 作者: 埋伏 時間: 2025-3-24 04:15
Vitalenergie (Qi) und Blut (Xue),hip and show that, in a precise sense, direct semantics are included in continuation semantics..The heart of the problem is the construction of a relation which must be a fixed-point of a non-monotonic “relational functor.” A general method is given for the construction of such relations between recursively defined domains.作者: Lymphocyte 時間: 2025-3-24 08:37
On the Relation between Direct and Continuation Semanticship and show that, in a precise sense, direct semantics are included in continuation semantics..The heart of the problem is the construction of a relation which must be a fixed-point of a non-monotonic “relational functor.” A general method is given for the construction of such relations between recursively defined domains.作者: Permanent 時間: 2025-3-24 13:07
https://doi.org/10.1007/3-211-29992-0 basepoints, we provide a single formalism in which the different combinations of call-by-value and call-by-name are represented by different products of relations, and in which only one minimal fixed point operator is needed. Moreover this mathematical description is axiomatized, thus yielding a re作者: FLASK 時間: 2025-3-24 16:22 作者: 繁榮中國 時間: 2025-3-24 22:41
Vitalenergie (Qi) und Blut (Xue),tantially contributes to the reduction in size obtained, and also provides a solution to an open problem by Aho and Ullman [4]. The sizes of the parsers obtained using the parser’s algorithm are compared with those of Anderson, Eve, and Horning [1].作者: Ingest 時間: 2025-3-25 02:12 作者: 有常識 時間: 2025-3-25 03:45
Production Prefix Parsingace economies might be realized. Pager [19] found a minimal finite automaton from which to construct the parser. In [1], an approach is presented which attempts to merge states of the parsing automaton. Unfortunately, this procedure is not completely algorithmic.作者: Debate 時間: 2025-3-25 09:50
On Eliminating Unit Productions from LR(K) Parserstantially contributes to the reduction in size obtained, and also provides a solution to an open problem by Aho and Ullman [4]. The sizes of the parsers obtained using the parser’s algorithm are compared with those of Anderson, Eve, and Horning [1].作者: 慷慨援助 時間: 2025-3-25 13:40 作者: 新星 時間: 2025-3-25 17:13
https://doi.org/10.1007/3-211-29992-0Nous décrivons ici un algorithme pour décider de l’équivalence dans un domaine dont les éléments sont définis par des systèmes d’équations au point fixe. Cet algorithme est utilisé pour trouver diverses représentations minimales des éléments du domaine.作者: commune 時間: 2025-3-25 23:03
https://doi.org/10.1007/978-3-658-00415-6In the paper we propose certain methods of economizing the storage space of a computer while storing there a system of information storage and retrieval.作者: FLOUR 時間: 2025-3-26 01:52
Graph Representation and Computation Rules for Typeless Recursive LanguagesComputations are carried out in recursive languages by the iterative application of two kinds of transformation rules (substitution and simplification rules) to an initial term.作者: Diuretic 時間: 2025-3-26 04:43
Algorithmes d’Equivalence et de Reduction a des Expressions Minimales dans Une Classe d’Equations ReNous décrivons ici un algorithme pour décider de l’équivalence dans un domaine dont les éléments sont définis par des systèmes d’équations au point fixe. Cet algorithme est utilisé pour trouver diverses représentations minimales des éléments du domaine.作者: addition 時間: 2025-3-26 11:21
File Organization, an Application of Graph TheoryIn the paper we propose certain methods of economizing the storage space of a computer while storing there a system of information storage and retrieval.作者: 單獨 時間: 2025-3-26 16:12
Yang Sheng (Gesundheitspflege),t every recursively enumerable set is generated by some such grammar, its use to the description of the full syntax of ALGOL 68 had to wait until recently [4]. The even more ambitious project of using such a grammar to give an integrated definition of both syntax and semantics of ALGOL 68 has been u作者: myopia 時間: 2025-3-26 20:50 作者: ESPY 時間: 2025-3-26 23:31 作者: HOWL 時間: 2025-3-27 03:55 作者: 充足 時間: 2025-3-27 06:10
https://doi.org/10.1007/3-211-29992-0t theory for lattices, is given. Furthermore it is shown that a dynamic programming problem can be formulated in a suitable regular algebra and the system can be solved using Gaussian elimination..A dynamic programming problem can be posed independently of the particular values of functions and cons作者: 修飾語 時間: 2025-3-27 10:22 作者: 輕率看法 時間: 2025-3-27 16:29 作者: collateral 時間: 2025-3-27 19:11 作者: Amylase 時間: 2025-3-27 23:22
Vitalenergie (Qi) und Blut (Xue),h specific aspects of automatic computing, like program structure, semantics, computational complexity. On the other side,more recently, there has been a growing need for relating results concerning the various aspects of automatic computing in order to enrich the different approaches and in order t作者: Kaleidoscope 時間: 2025-3-28 02:15 作者: 伸展 時間: 2025-3-28 06:15
https://doi.org/10.1007/3-211-29992-0e also defined, which are less restrictive than the first. These properties are used to decide:.The transformations of algorithms our methods yield are particularly significant in that they depend only on the semantics of the original algorithm, i.e., the input-output relations..To perform the paral作者: arthroscopy 時間: 2025-3-28 11:03
Vitalenergie (Qi) und Blut (Xue),nship to pattern-matching problems is discussed..In particular, the solvability of such an equation is decided in the cases: . For this purpose, a polynomial representation and subsequently a tree representation of normal forms are introduced.作者: 貧困 時間: 2025-3-28 17:19 作者: Ornament 時間: 2025-3-28 20:23
Vitalenergie (Qi) und Blut (Xue),ic context-free language, there were serious obstacles to its use in practice. The method in [17] leads to table-driven parsers in which the size. can grow exponentially with the number of productions. (An example may be found in [4].) In [18], Korenjak proposed to partition grammars to obtain small作者: FLASK 時間: 2025-3-29 00:15 作者: 記憶 時間: 2025-3-29 03:05
Vitalenergie (Qi) und Blut (Xue),-transducers. Several results (camplexity and efficiency) are established, same new and other previously proved only in special cases. As an application, we show that for every family of deterministic context-free pushdown parsers (e.g. precedence, LR(k), LL(k), ...) there is a family of general con作者: 啪心兒跳動 時間: 2025-3-29 09:34
Automata, Languages and Programming978-3-662-21545-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 耐寒 時間: 2025-3-29 13:31 作者: 帽子 時間: 2025-3-29 16:45
https://doi.org/10.1007/3-211-29992-0n F when occurrences of symbols are permuted. At the same time, the methods used imply a new and simple algebraic proof of Parikh’s original theorem, directly transforming an arbitrary context-free grammar into a letter-equivalent regular grammar. Further applications are discussed.作者: Malfunction 時間: 2025-3-29 22:09
https://doi.org/10.1007/3-211-29992-0It is well known that, for a given context-free grammar G, the recognition problem “x ∈ L(G)” can be decided in 0(|x|). steps by a suitable algorithm. How do extensions behave in this respect? In particular, do they admit recognition algorithms whose time is polynomially bounded by the length of the input?作者: Protein 時間: 2025-3-30 02:46 作者: Congruous 時間: 2025-3-30 08:00 作者: cancer 時間: 2025-3-30 12:06
Vitalenergie (Qi) und Blut (Xue),nship to pattern-matching problems is discussed..In particular, the solvability of such an equation is decided in the cases: . For this purpose, a polynomial representation and subsequently a tree representation of normal forms are introduced.作者: Pelvic-Floor 時間: 2025-3-30 13:44
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166192.jpg作者: pessimism 時間: 2025-3-30 20:29 作者: 使虛弱 時間: 2025-3-30 22:47 作者: 分開 時間: 2025-3-31 01:11
A Generalisation of Parikh’s Theorem in Formal Language Theoryn F when occurrences of symbols are permuted. At the same time, the methods used imply a new and simple algebraic proof of Parikh’s original theorem, directly transforming an arbitrary context-free grammar into a letter-equivalent regular grammar. Further applications are discussed.作者: 會犯錯誤 時間: 2025-3-31 08:23 作者: Collar 時間: 2025-3-31 11:53 作者: OWL 時間: 2025-3-31 14:10
Relations between Semantics and Complexity of Recursive Programsh specific aspects of automatic computing, like program structure, semantics, computational complexity. On the other side,more recently, there has been a growing need for relating results concerning the various aspects of automatic computing in order to enrich the different approaches and in order to build more adequate theories.作者: 招募 時間: 2025-3-31 18:38
Combinatorial Problems, Combinator Equations and Normal Formsnship to pattern-matching problems is discussed..In particular, the solvability of such an equation is decided in the cases: . For this purpose, a polynomial representation and subsequently a tree representation of normal forms are introduced.作者: 半圓鑿 時間: 2025-3-31 22:28
The Generative Power of Two-Level Grammarst every recursively enumerable set is generated by some such grammar, its use to the description of the full syntax of ALGOL 68 had to wait until recently [4]. The even more ambitious project of using such a grammar to give an integrated definition of both syntax and semantics of ALGOL 68 has been u作者: 僵硬 時間: 2025-4-1 03:29 作者: 蕨類 時間: 2025-4-1 09:17
Checking Stacks and Context-Free Programmed Grammars Accept p-complete LanguagesIt is well known that, for a given context-free grammar G, the recognition problem “x ∈ L(G)” can be decided in 0(|x|). steps by a suitable algorithm. How do extensions behave in this respect? In particular, do they admit recognition algorithms whose time is polynomially bounded by the length of the作者: 財主 時間: 2025-4-1 11:09 作者: Fortuitous 時間: 2025-4-1 15:47
Dynamic Programming Schematat theory for lattices, is given. Furthermore it is shown that a dynamic programming problem can be formulated in a suitable regular algebra and the system can be solved using Gaussian elimination..A dynamic programming problem can be posed independently of the particular values of functions and cons
