標題: Titlebook: Developments in Language Theory; 28th International C Joel D. Day,Florin Manea Conference proceedings 2024 The Editor(s) (if applicable) an [打印本頁] 作者: 要求 時間: 2025-3-21 16:54
書目名稱Developments in Language Theory影響因子(影響力)
書目名稱Developments in Language Theory影響因子(影響力)學科排名
書目名稱Developments in Language Theory網絡公開度
書目名稱Developments in Language Theory網絡公開度學科排名
書目名稱Developments in Language Theory被引頻次
書目名稱Developments in Language Theory被引頻次學科排名
書目名稱Developments in Language Theory年度引用
書目名稱Developments in Language Theory年度引用學科排名
書目名稱Developments in Language Theory讀者反饋
書目名稱Developments in Language Theory讀者反饋學科排名
作者: Formidable 時間: 2025-3-21 23:55
,Cellular Automata: From Black-and-White to?High Gloss Color,s for formal languages. As usual, these systems then act as deciders whose output is yes or no. A second point of view takes the perspective of more complex outputs. Now cellular automata not only compute a binary output, but they transform inputs into outputs, that is, they act as transducers. In t作者: abysmal 時間: 2025-3-22 02:55
,Deciding Conjugacy of?a?Rational Relation,g whether a rational relation is conjugate is decidable. This extended abstract outlines the proof of this fact. A result of independent interest is a generalisation of the classical Lyndon-Schützenberger theorem from word combinatorics that equates conjugacy of a pair of words (.,?.) and the existe作者: 放縱 時間: 2025-3-22 07:56
,Logic and?Languages of?Higher-Dimensional Automata,terval pomsets with interfaces (.) closed under order extension. We prove that languages of HDAs are MSO-definable. For the converse, we show that the order extensions of MSO-definable sets of . are languages of HDAs. Furthermore, both constructions are effective. As a consequence, unlike the case o作者: 擁擠前 時間: 2025-3-22 10:48
,Universal Rewriting Rules for?the?Parikh Matrix Injectivity Problem,such as a necessary condition of the .-equivalence or characterization of the .-equivalence over a binary or ternary alphabet. While these studies give rise to rewriting rules that construct .-equivalent strings of a given string over a binary or ternary alphabet, it has been open to designing gener作者: jeopardize 時間: 2025-3-22 13:51
, is a?Multiple Context-Free Grammar: An Implementation-, Formalisation-Friendly Proof,nd, therefore, in the theory of computation. Furthermore, such kind of analysis can give insight into the classification of abstract algebraic structure such as groups, for example through the correspondence given by the word problem. While many such classification problems remain open, others have 作者: jeopardize 時間: 2025-3-22 19:45 作者: CLAN 時間: 2025-3-23 01:16
,On the?Complexity and?Approximability of?Bounded Access Lempel Ziv Coding,LZ76 (also known as LZ77 or simply Lempel-Ziv) encoding of . based on ., it is possible to identify/decompress the character . by performing at most . accesses to the LZ encoding, for a given integer .. We refer to such a parsing . as a .-bounded access LZ parsing or .-BLZ parsing of . We show that 作者: 危機 時間: 2025-3-23 04:11 作者: 使苦惱 時間: 2025-3-23 08:27
The Pumping Lemma for Context-Free Languages is Undecidable, previously fixed regular pumping lemma w.r.t. the value?., was considered in [. and . and .. The Pumping Lemma for Regular Languages is Hard. ., pp. 128-140.]. Here we generalize the . by investigating Bar-Hillel’s context-free pumping lemma instead. It turns out that for context-free languages, th作者: visual-cortex 時間: 2025-3-23 13:27 作者: Suppository 時間: 2025-3-23 14:01
,Semidirect Product Decompositions for?Periodic Regular Languages, example, the language . has period two because the length of a recursion (cycle) in its DFA must be even.. This paper shows that the period of a regular language appears as a cyclic group within its syntactic monoid. Specifically, we show that a regular language has period . if and only if its synt作者: Commonwealth 時間: 2025-3-23 18:53 作者: Neutropenia 時間: 2025-3-23 22:48
,Deterministic Pushdown Automata with?Translucent Input Letters,om left to right on the input. Depending on the current state of the automaton, some symbols are visible and can be processed, whereas some other symbols are invisible, and may be processed in another sweep. We also distinguish between the returning and non-returning mode, which differ from the fact作者: WAIL 時間: 2025-3-24 04:12 作者: 津貼 時間: 2025-3-24 09:38
,Finite Automata with?Sets of?Translucent Words,the one hand, we restrict the cardinality of the sets of translucent letters, while, on the other hand, we introduce finite automata for which each state has an associated set of words that are translucent for that state. Here we require that each such set is a finite prefix code. We expect that, ba作者: Ophthalmologist 時間: 2025-3-24 11:19 作者: 幾何學家 時間: 2025-3-24 17:51
,Verifying and?Interpreting Neural Networks Using Finite Automata,luding safety-critical ones, and their black-box nature. We propose an automata-theoretic approach to tackling problems arising in DNN analysis. We show that the input-output behaviour of a DNN can be captured precisely by a (special) weak Büchi automaton and we show how these can be used to address作者: 蜈蚣 時間: 2025-3-24 20:19 作者: Vulnerable 時間: 2025-3-25 01:45
Dünnwandige isotrope Fl?chen, Hautfelders for formal languages. As usual, these systems then act as deciders whose output is yes or no. A second point of view takes the perspective of more complex outputs. Now cellular automata not only compute a binary output, but they transform inputs into outputs, that is, they act as transducers. In t作者: modish 時間: 2025-3-25 04:01
https://doi.org/10.1007/978-3-642-61032-5g whether a rational relation is conjugate is decidable. This extended abstract outlines the proof of this fact. A result of independent interest is a generalisation of the classical Lyndon-Schützenberger theorem from word combinatorics that equates conjugacy of a pair of words (.,?.) and the existe作者: 偏離 時間: 2025-3-25 09:14
https://doi.org/10.1007/978-3-642-52843-9terval pomsets with interfaces (.) closed under order extension. We prove that languages of HDAs are MSO-definable. For the converse, we show that the order extensions of MSO-definable sets of . are languages of HDAs. Furthermore, both constructions are effective. As a consequence, unlike the case o作者: 高度 時間: 2025-3-25 15:27
such as a necessary condition of the .-equivalence or characterization of the .-equivalence over a binary or ternary alphabet. While these studies give rise to rewriting rules that construct .-equivalent strings of a given string over a binary or ternary alphabet, it has been open to designing gener作者: CHARM 時間: 2025-3-25 15:48
Origin of the Malagasy Strepsirhine Primatesnd, therefore, in the theory of computation. Furthermore, such kind of analysis can give insight into the classification of abstract algebraic structure such as groups, for example through the correspondence given by the word problem. While many such classification problems remain open, others have 作者: extinct 時間: 2025-3-25 20:26 作者: 一罵死割除 時間: 2025-3-26 02:11 作者: 自然環(huán)境 時間: 2025-3-26 05:32
H.S. Sekhon,Guriqbal Singh,Hari Rams switch to pangenomic references. Fortunately, we are usually interested only in the relatively few MEMs that are longer than we would expect by chance. In this paper we show that under reasonable assumptions we can find all MEMs of length at least . between a pattern of length . and a text of leng作者: 厭食癥 時間: 2025-3-26 11:00 作者: 不容置疑 時間: 2025-3-26 13:23
C. Hiemke,J. Hoehn,H. Weigmann,W. Oehlcertain problems are decidable. One problem that has been difficult to answer throughout the history of automata and formal language theory is to decide whether a given system . accepts a bounded language (whether there exist words . such that .?). Boundedness was only known to be decidable for regu作者: Mucosa 時間: 2025-3-26 18:43 作者: charisma 時間: 2025-3-26 21:18 作者: 巧思 時間: 2025-3-27 04:48
Clinical Applications of Leptin,om left to right on the input. Depending on the current state of the automaton, some symbols are visible and can be processed, whereas some other symbols are invisible, and may be processed in another sweep. We also distinguish between the returning and non-returning mode, which differ from the fact作者: ESO 時間: 2025-3-27 06:04
Unbewusstes (implizites) Lernen,for them, the Token-Ring and Token-Bus topology. The new topologies have two working modes and will be illustrated with an example. We study the computational power of deterministic Token-Ring and Token-Bus PCFA and prove that they are equal to deterministic one-way multi-head finite automata. The s作者: 宮殿般 時間: 2025-3-27 10:56 作者: Lumbar-Spine 時間: 2025-3-27 14:36
Raum als sozialer (Erfahrungs)Raumord for such automata can be of length ., where . is the number of states of an automaton. Additionally, we prove that checking whether a given one-cluster partial automaton is carefully synchronizing is NP-hard, even for the binary alphabet.作者: 構成 時間: 2025-3-27 19:10
luding safety-critical ones, and their black-box nature. We propose an automata-theoretic approach to tackling problems arising in DNN analysis. We show that the input-output behaviour of a DNN can be captured precisely by a (special) weak Büchi automaton and we show how these can be used to address作者: BYRE 時間: 2025-3-27 22:41
https://doi.org/10.1007/978-3-031-66159-4automata theory; finite automata; formal languages; graph theory; linguistics; theory of computation; form作者: foreign 時間: 2025-3-28 05:57 作者: 縱火 時間: 2025-3-28 06:30 作者: hurricane 時間: 2025-3-28 14:19 作者: 艦旗 時間: 2025-3-28 15:39 作者: 輕率的你 時間: 2025-3-28 18:59
Developments in Language Theory978-3-031-66159-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: giggle 時間: 2025-3-29 00:46 作者: spinal-stenosis 時間: 2025-3-29 04:22 作者: textile 時間: 2025-3-29 08:34
Conference proceedings 2024Germany, during August 12–16, 2024...The 17 full papers and 4 invited papers included in this book were carefully reviewed and selected from 26 submissions. They presented current developments in formal languages and automata. The?scope is very general and includes, among others, the following topic作者: Crayon 時間: 2025-3-29 14:42 作者: 類型 時間: 2025-3-29 16:10
The 1905 Revolution and its Aftermath, so far much literature on OPLs has assumed the hypothesis that the equality precedence relation cannot be cyclic. We present an enriched version of operator precedence grammars which allows to remove the above hypothesis, therefore providing a little more expressive generality, and to further optimize parallel compilation.作者: CALL 時間: 2025-3-29 21:37 作者: nephritis 時間: 2025-3-30 03:10 作者: 直覺好 時間: 2025-3-30 06:00
,Universal Rewriting Rules for?the?Parikh Matrix Injectivity Problem,rings, as an intermediate representation. We introduce a special normal form for an exponent-string and prove that any string can be rewritten into an .-equivalent exponent-string in this special form. Then, we show that our rewriting rules characterize .-equivalence over an ordered alphabet of an arbitrary size.作者: 污穢 時間: 2025-3-30 10:03
,Cyclic Operator Precedence Grammars for?Improved Parallel Parsing, so far much literature on OPLs has assumed the hypothesis that the equality precedence relation cannot be cyclic. We present an enriched version of operator precedence grammars which allows to remove the above hypothesis, therefore providing a little more expressive generality, and to further optimize parallel compilation.作者: 災難 時間: 2025-3-30 16:09
,On the?Complexity and?Approximability of?Bounded Access Lempel Ziv Coding,so APX hard, i.e., no PTAS can exist under the standard complexity assumption . We also study the ratio between the sizes of an optimal .-BLZ parsing of a string . and an optimal LZ76 parsing of . (which can be greedily computed in polynomial time).作者: HAUNT 時間: 2025-3-30 19:47
,Semidirect Product Decompositions for?Periodic Regular Languages,re the relation between the structure of Markov chains and our result, and apply this relation to the theory of probabilities of languages. We also discuss the Krohn-Rhodes decomposition of finite semigroups, which is strongly linked to our methods.作者: Armory 時間: 2025-3-30 23:43
,Deciding Conjugacy of?a?Rational Relation, generalisation of the classical Lyndon-Schützenberger theorem from word combinatorics that equates conjugacy of a pair of words (.,?.) and the existence of a word . (called a .) such that ...A full version of the paper, with details of the proof, can be found on arXiv [.].作者: 角斗士 時間: 2025-3-31 04:08 作者: craving 時間: 2025-3-31 05:17 作者: 武器 時間: 2025-3-31 12:09
The Pumping Lemma for Context-Free Languages is Undecidable,128-140.]. Here we generalize the . by investigating Bar-Hillel’s context-free pumping lemma instead. It turns out that for context-free languages, the . for Bar-Hillel’s pumping lemma is undecidable. When restricted to regular languages, the problem under consideration becomes decidable.作者: 最高點 時間: 2025-3-31 15:00
,Verifying and?Interpreting Neural Networks Using Finite Automata,ow that the input-output behaviour of a DNN can be captured precisely by a (special) weak Büchi automaton and we show how these can be used to address common verification and interpretation tasks of DNN like adversarial robustness or minimum sufficient reasons.作者: Accolade 時間: 2025-3-31 21:04 作者: Aprope 時間: 2025-3-31 21:42 作者: bourgeois 時間: 2025-4-1 03:26
Instrumentelle Konditionierung,sed on the cardinality of the sets of translucent words and the length of the longest word admitted in any set of this form, a strictly increasing two-dimensional hierarchy of language classes is obtained. In addition, we study closure and non-closure properties for the resulting language classes.作者: 天氣 時間: 2025-4-1 09:10
0302-9743 ?ttingen, Germany, during August 12–16, 2024...The 17 full papers and 4 invited papers included in this book were carefully reviewed and selected from 26 submissions. They presented current developments in formal languages and automata. The?scope is very general and includes, among others, the follo作者: 無底 時間: 2025-4-1 11:14
https://doi.org/10.1007/978-3-642-61032-5 generalisation of the classical Lyndon-Schützenberger theorem from word combinatorics that equates conjugacy of a pair of words (.,?.) and the existence of a word . (called a .) such that ...A full version of the paper, with details of the proof, can be found on arXiv [.].作者: cathartic 時間: 2025-4-1 17:58
