標(biāo)題: Titlebook: Developments in Language Theory; 22nd International C Mizuho Hoshi,Shinnosuke Seki Conference proceedings 2018 Springer Nature Switzerland [打印本頁] 作者: eternal 時間: 2025-3-21 18:45
書目名稱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é)科排名
作者: induct 時間: 2025-3-21 20:33 作者: 泥瓦匠 時間: 2025-3-22 03:07
A Brief Excursion to Parity Games,terms of running time, this is currently the most efficient algorithm that solves the parity games problem. The goal of this lecture is to give a brief background to the problem and present the algorithm in a somewhat informal way with a bit more emphasis on ideas rather than formal details.作者: IVORY 時間: 2025-3-22 06:51 作者: 難取悅 時間: 2025-3-22 10:11 作者: 廣口瓶 時間: 2025-3-22 13:21
Weak Cost Register Automata Are Still Powerful, using . and increments. We show that this model can simulate, in some sense, the runs of counter machines with zero-tests. We deduce that a number of problems pertaining to that model are undecidable, in particular equivalence, disproving a conjecture of Alur?et?al.?from 2012. To emphasize how weak作者: 廣口瓶 時間: 2025-3-22 20:41
From Two-Way Transducers to Regular Function Expressions,word functions, characterized by means of (functional, or unambiguous, or deterministic) two-way transducers, copyless streaming string transducers, and MSO-definable graph transformations. A fundamental result in language theory is Kleene’s Theorem, relating finite state automata and regular expres作者: 壓迫 時間: 2025-3-22 22:12
Decidability of Right One-Way Jumping Finite Automata,ne-way jumping finite automata (ROWJFA), a variant of jumping automata, which is an automaton model for discontinuous information processing. Here we focus on decision problems for ROWJFAs. It turns out that most problems such as, e.g., emptiness, finiteness, universality, the word problem and varia作者: 膽大 時間: 2025-3-23 03:47
Tree-to-Graph Transductions with Scope, representations. These are graphs in which nodes encode concepts and edges relations. Node-sharing is common, and cycles occur. We show that the required structures can be generated through the combination of (i) a regular tree grammar, (ii) a sequence of linear top-down tree transducers, and (iii)作者: MAG 時間: 2025-3-23 08:45 作者: labile 時間: 2025-3-23 13:46 作者: 察覺 時間: 2025-3-23 17:43 作者: 有毒 時間: 2025-3-23 19:12
Site-Directed Deletion, two strings?. and ., a site-directed deletion partially deletes a substring of . guided by the string . that specifies which part of a substring can be deleted. We study a few decision problems with respect to the new operation and examine the closure properties of the (iterated) site-directed dele作者: Phagocytes 時間: 2025-3-23 23:08 作者: EXULT 時間: 2025-3-24 03:12
Weak Cost Register Automata Are Still Powerful, problems pertaining to that model are undecidable, in particular equivalence, disproving a conjecture of Alur?et?al.?from 2012. To emphasize how weak these machines are, we also show that they can be expressed as a restricted form of linearly-ambiguous weighted automata.作者: expository 時間: 2025-3-24 07:54 作者: 我不重要 時間: 2025-3-24 12:50 作者: cumulative 時間: 2025-3-24 18:30
Site-Directed Deletion,be deleted. We study a few decision problems with respect to the new operation and examine the closure properties of the (iterated) site-directed deletion operations. We, then, define a site-directed deletion-closed (and -free) language?. and investigate its decidability properties when . is regular or context-free.作者: fulmination 時間: 2025-3-24 22:32 作者: OREX 時間: 2025-3-25 02:49
0302-9743 n, in September 2018. The 39 full papers presented? in this volume were carefully?reviewed and selected from 84 submissions. The papers cover the?following topics and areas: combinatorial and algebraic properties??of words and languages; grammars, acceptors and transducers for?strings, trees, graphi作者: LAVA 時間: 2025-3-25 06:15
Lecture Notes in Computer Science problems pertaining to that model are undecidable, in particular equivalence, disproving a conjecture of Alur?et?al.?from 2012. To emphasize how weak these machines are, we also show that they can be expressed as a restricted form of linearly-ambiguous weighted automata.作者: 北極熊 時間: 2025-3-25 07:29 作者: LASH 時間: 2025-3-25 12:20
https://doi.org/10.1007/978-3-319-62120-3itivity process in the setting of a two-player probabilistic game and we make use of convex optimization techniques to describe its behavior. We report numerical results and supported by them we state a conjecture that, if true, would imply an upper bound of . on the reset threshold of a certain class of automata.作者: arthroscopy 時間: 2025-3-25 19:35
Human-Computer Systems Interactionbe deleted. We study a few decision problems with respect to the new operation and examine the closure properties of the (iterated) site-directed deletion operations. We, then, define a site-directed deletion-closed (and -free) language?. and investigate its decidability properties when . is regular or context-free.作者: FIG 時間: 2025-3-25 20:04 作者: 縱欲 時間: 2025-3-26 00:57
Tree-to-Graph Transductions with Scope, a fold operator that merges selected nodes. Delimiting the application of the fold operator to connected subgraphs gains expressive power, while keeping the complexity of the associated membership problem in polynomial time.作者: Watemelon 時間: 2025-3-26 07:36
Conference proceedings 2018; algebraic theories for automata and?languages; codes; efficient text algorithms; symbolic dynamics;?decision problems; relationships to complexity theory and logic; picture description and analysis, polyominoes and bidimensional?patterns; cryptography; concurrency; celluar automata; bio-inspired computing; quantum computing.作者: Yag-Capsulotomy 時間: 2025-3-26 10:28
0302-9743 mplexity theory and logic; picture description and analysis, polyominoes and bidimensional?patterns; cryptography; concurrency; celluar automata; bio-inspired computing; quantum computing.978-3-319-98653-1978-3-319-98654-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 殺菌劑 時間: 2025-3-26 14:26
Yueqing Li,Steve Johnson,Chang Nam Comput, pp. 1501–1514, 2017]. The characterization not only gives a surprisingly simple proof to the 15-years open problem but also provides completely new insights on how repetitions are packed into a string. In this article, we will briefly review the runs theorem and some related topics.作者: 芭蕾舞女演員 時間: 2025-3-26 20:17 作者: 槍支 時間: 2025-3-26 21:16
Abdullah Al Mahmud,Suleman Shahid,Omar Mubinuages can be accepted by ROWJFAs is decidable, too. On the other hand, we prove that for (linear) context-free languages the corresponding ROWJFA acceptance problem becomes undecidable. Moreover, we also discuss some complexity results for the considered decision problems.作者: 公司 時間: 2025-3-27 02:08 作者: 無所不知 時間: 2025-3-27 06:10
From Two-Way Transducers to Regular Function Expressions, transducers to regular function expressions extending the Brzozowski and McCluskey algorithm. In addition, we identify a subset of regular function expressions characterizing the (strict) subclass of functional sweeping transducers.作者: Oration 時間: 2025-3-27 10:47
Decidability of Right One-Way Jumping Finite Automata,uages can be accepted by ROWJFAs is decidable, too. On the other hand, we prove that for (linear) context-free languages the corresponding ROWJFA acceptance problem becomes undecidable. Moreover, we also discuss some complexity results for the considered decision problems.作者: Meditative 時間: 2025-3-27 14:32
J. Brian Pickering,Vegard Engen,Paul Wallandinvertibility, a property related to the implementation of an efficient inversion procedure. We show that the BWT and the Alternating BWT are the only rank-invertible transformations in the class we have defined.作者: 花費 時間: 2025-3-27 19:48 作者: cancellous-bone 時間: 2025-3-28 00:45 作者: 反叛者 時間: 2025-3-28 03:28
Azizi Ab Aziz,Michel C. A. KleinWe prove some new theorems in additive number theory, using novel techniques from automata theory and formal languages. As an example of our method, we prove that every natural number >25 is the sum of at most three natural numbers whose base-2 representation has an equal number of 0’s and 1’s.作者: 享樂主義者 時間: 2025-3-28 09:01 作者: forthy 時間: 2025-3-28 10:57
Lecture Notes in Computer ScienceThe problem of the commutative equivalence of context-free and regular languages is studied. In particular conditions ensuring that a context-free language of exponential growth is commutatively equivalent with a regular language are investigated.作者: forager 時間: 2025-3-28 15:00
Human-Computer Systems InteractionIn this paper, we extend Simon’s theorem to scattered words. We consider words whose length is a countable scattered linear orderings. We give an algebraic characterization of Boolean combinations of .-upper sets where . is the subword relation, also known as embedding on words.作者: 刺耳 時間: 2025-3-28 21:20
Some Open Problems in Polyomino Tilings,The author surveys 15?open problems regarding the algorithmic, structural, and existential properties of polyomino tilings.作者: Misnomer 時間: 2025-3-29 02:30 作者: 混沌 時間: 2025-3-29 03:46 作者: LIMIT 時間: 2025-3-29 08:28
On the Commutative Equivalence of Context-Free Languages,The problem of the commutative equivalence of context-free and regular languages is studied. In particular conditions ensuring that a context-free language of exponential growth is commutatively equivalent with a regular language are investigated.作者: 碎片 時間: 2025-3-29 14:57
,Simon’s Theorem for Scattered Words,In this paper, we extend Simon’s theorem to scattered words. We consider words whose length is a countable scattered linear orderings. We give an algebraic characterization of Boolean combinations of .-upper sets where . is the subword relation, also known as embedding on words.作者: 不知疲倦 時間: 2025-3-29 17:34 作者: myopia 時間: 2025-3-29 20:35 作者: absolve 時間: 2025-3-30 03:40 作者: 我正派 時間: 2025-3-30 05:55 作者: 牽連 時間: 2025-3-30 09:00 作者: enmesh 時間: 2025-3-30 13:07
Hiroshi Furukawa,Yutaka Nakamuraterms of running time, this is currently the most efficient algorithm that solves the parity games problem. The goal of this lecture is to give a brief background to the problem and present the algorithm in a somewhat informal way with a bit more emphasis on ideas rather than formal details.作者: 不如樂死去 時間: 2025-3-30 20:13 作者: 征服 時間: 2025-3-30 22:15 作者: accordance 時間: 2025-3-31 01:35 作者: 革新 時間: 2025-3-31 06:12
Lecture Notes in Computer Scienceword functions, characterized by means of (functional, or unambiguous, or deterministic) two-way transducers, copyless streaming string transducers, and MSO-definable graph transformations. A fundamental result in language theory is Kleene’s Theorem, relating finite state automata and regular expres作者: 向外才掩飾 時間: 2025-3-31 12:20 作者: 無聊點好 時間: 2025-3-31 17:06
Azizi Ab Aziz,Michel C. A. Klein representations. These are graphs in which nodes encode concepts and edges relations. Node-sharing is common, and cycles occur. We show that the required structures can be generated through the combination of (i) a regular tree grammar, (ii) a sequence of linear top-down tree transducers, and (iii)作者: Aggregate 時間: 2025-3-31 19:41
Lecture Notes in Computer Scienceed by the languages of the form . or ., where . is a language of .. We also describe the ultrafilter inequalities satisfied by the lattice . generated by the lattices ., for .. When . is a lattice of . languages, we first describe the profinite inequalities satisfied by . and . and then provide a sm作者: Magisterial 時間: 2025-4-1 01:24
https://doi.org/10.1007/978-3-319-62120-3ny conjecture by studying the primitivity phenomenon for sets of nonnegative matrices having neither zero-rows nor zero-columns. We formulate the primitivity process in the setting of a two-player probabilistic game and we make use of convex optimization techniques to describe its behavior. We repor作者: 使困惑 時間: 2025-4-1 02:55 作者: 執(zhí)拗 時間: 2025-4-1 08:02
Human-Computer Systems Interaction two strings?. and ., a site-directed deletion partially deletes a substring of . guided by the string . that specifies which part of a substring can be deleted. We study a few decision problems with respect to the new operation and examine the closure properties of the (iterated) site-directed dele作者: 野蠻 時間: 2025-4-1 10:11 作者: 誘拐 時間: 2025-4-1 14:48
A Brief Excursion to Parity Games,terms of running time, this is currently the most efficient algorithm that solves the parity games problem. The goal of this lecture is to give a brief background to the problem and present the algorithm in a somewhat informal way with a bit more emphasis on ideas rather than formal details.作者: botany 時間: 2025-4-1 19:50
A Tale of Conjunctive Grammars,ubstring that satisfies several syntactic conditions simultaneously. This family has been systematically studied since the turn of the century, and is a subject of current studies. This paper gives an overview of the current state of the art in the research on conjunctive grammars.
