標(biāo)題: Titlebook: Developments in Language Theory; 10th International C Oscar H. Ibarra,Zhe Dang Conference proceedings 2006 Springer-Verlag Berlin Heidelber [打印本頁] 作者: Body-Mass-Index 時間: 2025-3-21 17:43
書目名稱Developments in Language Theory影響因子(影響力)
書目名稱Developments in Language Theory影響因子(影響力)學(xué)科排名
書目名稱Developments in Language Theory網(wǎng)絡(luò)公開度
書目名稱Developments in Language Theory網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Developments in Language Theory被引頻次
書目名稱Developments in Language Theory被引頻次學(xué)科排名
書目名稱Developments in Language Theory年度引用
書目名稱Developments in Language Theory年度引用學(xué)科排名
書目名稱Developments in Language Theory讀者反饋
書目名稱Developments in Language Theory讀者反饋學(xué)科排名
作者: Aerophagia 時間: 2025-3-21 20:13 作者: 使迷醉 時間: 2025-3-22 03:41
Polynomials, Fragments of Temporal Logic and the Variety DA over Tracesbiguous polynomial closure over traces..We also show that there exist natural fragments of local temporal logic that describe this class of languages corresponding to .. All characterizations are known to hold for words.作者: resilience 時間: 2025-3-22 06:49
Equivalence of Functions Represented by Simple Context-Free Grammars with Outputions correspond also to one-state deterministic pushdown transducers. Our algorithm works in time polynomial with respect to |.|+ .(.), where |.| is the size of the textual description of ., and .(.) is the maximum of the shortest lengths of words generated by nonterminals of ..作者: BRIBE 時間: 2025-3-22 12:40 作者: 肉身 時間: 2025-3-22 14:35
Prime Decompositions of Regular Languageslanguages and using the characterization we show that every regular language over a unary alphabet has a prime decomposition. We show that there exist co-context-free languages that do not have prime decompositions.作者: 肉身 時間: 2025-3-22 19:22
Ciliate Bio-operations on Finite String Multisetsclasses of finite languages which can be obtained by the different strategies, and show that although the string operations we consider are reversible, their parallel application can produce effects resembling the irreversibility of the biological process of gene assembly in ciliates.作者: 彎腰 時間: 2025-3-22 23:07
Characterizing DNA Bond Shapes Using Trajectoriestypes of bond shapes frequently found in DNA computing..We examine the algebraic properties of sets of trajectories. In particular, we consider rotation of trajectories and weakening of the bonding conditions expressed by a set of DNA trajectories. We also consider decidability results for bond-freeness with respect to our definition.作者: 衍生 時間: 2025-3-23 05:03 作者: 無政府主義者 時間: 2025-3-23 08:42 作者: Crater 時間: 2025-3-23 11:02
Grundlagen und Strukturen der Messtechnik retain many of the qualities of canonical LALR(1) parsers: they are deterministic, easy to construct, and run in linear time. We argue that they could provide the basis for a range of powerful noncanonical parsers.作者: 頌揚(yáng)國家 時間: 2025-3-23 16:46 作者: Wernickes-area 時間: 2025-3-23 19:20 作者: Limousine 時間: 2025-3-23 23:56
Reibungsfreie inkompressible Str?mungenions correspond also to one-state deterministic pushdown transducers. Our algorithm works in time polynomial with respect to |.|+ .(.), where |.| is the size of the textual description of ., and .(.) is the maximum of the shortest lengths of words generated by nonterminals of ..作者: Dissonance 時間: 2025-3-24 03:11 作者: 值得尊敬 時間: 2025-3-24 09:53
F. Schmalzl,M. Ledochowski,H. Denzlanguages and using the characterization we show that every regular language over a unary alphabet has a prime decomposition. We show that there exist co-context-free languages that do not have prime decompositions.作者: venous-leak 時間: 2025-3-24 12:51 作者: 追蹤 時間: 2025-3-24 18:24
https://doi.org/10.1007/978-3-642-45561-2types of bond shapes frequently found in DNA computing..We examine the algebraic properties of sets of trajectories. In particular, we consider rotation of trajectories and weakening of the bonding conditions expressed by a set of DNA trajectories. We also consider decidability results for bond-freeness with respect to our definition.作者: Morose 時間: 2025-3-24 22:36
Egon Wetzels,Aldo Colombi,Horst Klinkmannn. We investigate closure properties of these codes, as well as necessary conditions for .-solid codes to be maximal. We show how the concept of .-join can be utilized such that codes that are not themselves .-comma free can be split into a union of subcodes that are .-comma free.作者: 膠狀 時間: 2025-3-25 01:15
Reibungsfreie inkompressible Str?mungenshow quotienting does preserve the language recognized. We propose a heuristic for reducing the size of alternating parity automata and parity games and, as an evidence for its usefulness, demonstrate that it is successful when applied to the Jurdziński family of parity games.作者: Impugn 時間: 2025-3-25 03:48
Simulation Relations for Alternating Parity Automata and Parity Gamesshow quotienting does preserve the language recognized. We propose a heuristic for reducing the size of alternating parity automata and parity games and, as an evidence for its usefulness, demonstrate that it is successful when applied to the Jurdziński family of parity games.作者: BAN 時間: 2025-3-25 09:05 作者: Regurgitation 時間: 2025-3-25 14:21
Erkrankungen des MakrophagensystemsA transductions. Perhaps the most important aspect of this work consists in defining nondeterministic bimachines and describing their power by linking them with weakly ambiguous finite transducers (IU and FA).作者: 帶來 時間: 2025-3-25 19:12
https://doi.org/10.1007/978-3-642-70908-1form, we propose an . algorithm for parsing that applies to any such normalized boolean grammar. In summary, the main contribution of this paper is to provide a semantics which applies to . boolean grammars while at the same time retaining the complexity of parsing associated with this type of grammars.作者: 使更活躍 時間: 2025-3-25 23:35 作者: 青少年 時間: 2025-3-26 03:30
On Weakly Ambiguous Finite TransducersA transductions. Perhaps the most important aspect of this work consists in defining nondeterministic bimachines and describing their power by linking them with weakly ambiguous finite transducers (IU and FA).作者: 高度贊揚(yáng) 時間: 2025-3-26 07:47
Well-Founded Semantics for Boolean Grammarsform, we propose an . algorithm for parsing that applies to any such normalized boolean grammar. In summary, the main contribution of this paper is to provide a semantics which applies to . boolean grammars while at the same time retaining the complexity of parsing associated with this type of grammars.作者: Pulmonary-Veins 時間: 2025-3-26 08:51
On the Gap-Complexity of Simple RL-Automata. Here we study the . of these automata. The membership problem for a language that is accepted by a .-.-automaton with a bounded number of gaps can be solved in polynomial time. On the other hand, .-.-automata with an unbounded number of gaps accept .-complete languages.作者: 谷類 時間: 2025-3-26 15:36 作者: 節(jié)省 時間: 2025-3-26 19:21
Context-Free Grammars and XML Languagesable; while establishing whether its surfaces are regular turns out to be undecidable whenever the deterministic language is contained in the Dyck language with two pairs of parentheses. Our results are based on a “pumping property” of what Boasson and Berstel call the surface of a context-free language.作者: 抵押貸款 時間: 2025-3-27 00:35 作者: Lucubrate 時間: 2025-3-27 03:13
978-3-540-35428-4Springer-Verlag Berlin Heidelberg 2006作者: FLOUR 時間: 2025-3-27 05:29
Developments in Language Theory978-3-540-35430-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: voluble 時間: 2025-3-27 10:20 作者: calumniate 時間: 2025-3-27 17:38
I Regelungs- und Steuerungstechnik, the abstraction level. ASMs and ASM based tools have been used in academia and industry to give precise semantics for computing artifacts and to specify software and hardware [1, 2, 6]. In connection to the conference on Developments in Language Theory, we consider how and whether ASMs could be useful in language theory.作者: 手段 時間: 2025-3-27 20:57 作者: NAV 時間: 2025-3-27 23:59 作者: 和平主義者 時間: 2025-3-28 05:40
I Regelungs- und Steuerungstechnik,After a brief introduction to membrane computing, pointing out the more important intersections with formal language theory, we survey a series of recent results related to spiking neural P systems used as devices for handling languages. Several open problems are formulated.作者: CORE 時間: 2025-3-28 07:16 作者: 保守黨 時間: 2025-3-28 10:26
Languages in Membrane Computing: Some Details for Spiking Neural P SystemsAfter a brief introduction to membrane computing, pointing out the more important intersections with formal language theory, we survey a series of recent results related to spiking neural P systems used as devices for handling languages. Several open problems are formulated.作者: 修飾語 時間: 2025-3-28 17:08 作者: Tdd526 時間: 2025-3-28 21:26
Can Abstract State Machines Be Useful in Language Theory? the abstraction level. ASMs and ASM based tools have been used in academia and industry to give precise semantics for computing artifacts and to specify software and hardware [1, 2, 6]. In connection to the conference on Developments in Language Theory, we consider how and whether ASMs could be useful in language theory.作者: Anticonvulsants 時間: 2025-3-29 00:27
Computational Nature of Biochemical Reactionsgulation mechanisms are: facilitation/acceleration and inhibition/retardation. The interaction between individual biochemical reactions takes place through their influence on each other, and this influence is through facilitation or inhibition (or both).作者: accrete 時間: 2025-3-29 05:41 作者: CORD 時間: 2025-3-29 10:03 作者: 猛烈責(zé)罵 時間: 2025-3-29 13:32 作者: 象形文字 時間: 2025-3-29 18:15
Deskriptive und Induktive Statistik over traces. To this aim we give algebraic characterizations for the language operations of generating the polynomial closure and generating the unambiguous polynomial closure over traces..We also show that there exist natural fragments of local temporal logic that describe this class of languages 作者: 是突襲 時間: 2025-3-29 23:02
Reibungsfreie inkompressible Str?mungenmulation relation can be computed in polynomial time and (ii) delayed simulation implies language inclusion. On the negative side, we point out that quotienting with respect to delayed simulation does not preserve the language recognized, which means that delayed simulation cannot be used for state-作者: 關(guān)節(jié)炎 時間: 2025-3-30 01:52
Reibungsfreie inkompressible Str?mungencontext free grammar . with output alphabet Ω. In this paper we present an efficient algorithm for testing equivalence of simple functions. Such functions correspond also to one-state deterministic pushdown transducers. Our algorithm works in time polynomial with respect to |.|+ .(.), where |.| is t作者: 易改變 時間: 2025-3-30 05:01
https://doi.org/10.1007/978-3-662-64372-3study a new type of restarting automaton, the so-called ..., which is an .-automaton that is rather restricted in that it has a window of size?1 only, and that it works under a minimal acceptance condition. On the other hand, it is allowed to perform up to . rewrite (that is, delete) steps per cycle作者: 放棄 時間: 2025-3-30 12:10
Grundlagen und Strukturen der Messtechnikical parsers. To this end, we present a definition of noncanonical LALR(1) parsers, NLALR(1). The class of grammars accepted by NLALR(1) parsers is a proper superclass of the NSLR(1) and LALR(1) grammar classes. Among the recognized languages are some nondeterministic languages. The proposed parsers作者: 在前面 時間: 2025-3-30 16:03 作者: Ascendancy 時間: 2025-3-30 18:17 作者: disparage 時間: 2025-3-30 21:54 作者: 知識分子 時間: 2025-3-31 04:09 作者: Connotation 時間: 2025-3-31 06:50
Erkrankungen des Makrophagensystemsy. We define input-unambiguous (IU) and input-deterministic (ID) transducers, and transducers with finite codomain (FC). IU transductions are characterized by nondeterministic bimachines and ID transductions can be represented as a composition of sequential functions and finite substitutions. FC tra作者: Console 時間: 2025-3-31 09:56 作者: 潰爛 時間: 2025-3-31 14:52
https://doi.org/10.1007/978-3-642-45561-2. Using an new definition of bond-freeness, we show that we can increase the types of DNA bond shapes which are expressible. This is motivated by the types of bond shapes frequently found in DNA computing..We examine the algebraic properties of sets of trajectories. In particular, we consider rotati作者: 使堅硬 時間: 2025-3-31 19:59 作者: cognizant 時間: 2025-3-31 23:09 作者: Gnrh670 時間: 2025-4-1 04:50 作者: accrete 時間: 2025-4-1 07:57 作者: 無瑕疵 時間: 2025-4-1 12:10
Computational Nature of Biochemical Reactionsgulation mechanisms are: facilitation/acceleration and inhibition/retardation. The interaction between individual biochemical reactions takes place through their influence on each other, and this influence is through facilitation or inhibition (or both).作者: DNR215 時間: 2025-4-1 14:55
