標題: Titlebook: Developments in Language Theory; 25th International C Nelma Moreira,Rogério Reis Conference proceedings 2021 Springer Nature Switzerland AG [打印本頁] 作者: 遠見 時間: 2025-3-21 17:52
書目名稱Developments in Language Theory影響因子(影響力)
書目名稱Developments in Language Theory影響因子(影響力)學科排名
書目名稱Developments in Language Theory網(wǎng)絡公開度
書目名稱Developments in Language Theory網(wǎng)絡公開度學科排名
書目名稱Developments in Language Theory被引頻次
書目名稱Developments in Language Theory被引頻次學科排名
書目名稱Developments in Language Theory年度引用
書目名稱Developments in Language Theory年度引用學科排名
書目名稱Developments in Language Theory讀者反饋
書目名稱Developments in Language Theory讀者反饋學科排名
作者: 別名 時間: 2025-3-21 20:50 作者: 大洪水 時間: 2025-3-22 03:45
Two-Way Non-uniform Finite Automataals .. Hence, we can show that many interesting problems concerning the state complexity of families of automata carry over to the problems concerning advice size of non-uniform automata. In particular, the question whether there can be a more than polynomial gap in advice between determinism and no作者: 羽飾 時間: 2025-3-22 05:11
Conference proceedings 2021n and compression; e?cient text algorithms; relationships to cryptography, concurrency, complexity theory, and logic; bio-inspired computing; quantum computing. The book also includes 3 invited talks in full paper length...?.作者: Androgen 時間: 2025-3-22 09:33
0302-9743 anipulation and compression; e?cient text algorithms; relationships to cryptography, concurrency, complexity theory, and logic; bio-inspired computing; quantum computing. The book also includes 3 invited talks in full paper length...?.978-3-030-81507-3978-3-030-81508-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: MAPLE 時間: 2025-3-22 13:59 作者: MAPLE 時間: 2025-3-22 18:38
Green IS in Education Industry: A Case Studydimensions a similar property (known as Extended Medvedev’s theorem) of the regular word languages, concerning the minimal alphabetic ratio needed to define a language by means of a projection of an SLT word language.作者: machination 時間: 2025-3-22 22:59
Ning He,Ke Lu,Yixue Wang,Yue Gaoals .. Hence, we can show that many interesting problems concerning the state complexity of families of automata carry over to the problems concerning advice size of non-uniform automata. In particular, the question whether there can be a more than polynomial gap in advice between determinism and no作者: entail 時間: 2025-3-23 05:19 作者: BARGE 時間: 2025-3-23 08:26 作者: 陪審團 時間: 2025-3-23 11:17
Weighted Prefix Normal Words: Mind the Gapeveral new peculiarities that did not already occur in the binary case. We characterise these issues and finally present a standard technique to obtain a generalised prefix normal form for all words over arbitrary, finite alphabets.作者: Decongestant 時間: 2025-3-23 17:51 作者: FLACK 時間: 2025-3-23 21:51 作者: Ventricle 時間: 2025-3-24 00:30 作者: 全部 時間: 2025-3-24 04:52 作者: 機構 時間: 2025-3-24 06:46 作者: 消極詞匯 時間: 2025-3-24 13:36 作者: Terrace 時間: 2025-3-24 15:21
Grounding of Concept, Indexical, and Name .-regular expressions and, using the shuffle on trajectories operator, we define grammars for balanced-by-construction expressions with which one can express every balanced regular and .-regular language.作者: ironic 時間: 2025-3-24 22:11
Active Learning of Sequential Transducers with Side Information About the Domainequential string transducers, where a regular overapproximation of the domain is known by the student. We show that there exists an algorithm to learn subsequential string transducers with a better guarantee on the required number of equivalence queries than classical active learning.作者: 猛烈責罵 時間: 2025-3-25 02:58
Integer Weighted Automata on Infinite Wordstheir complements with respect to the universality and the emptiness problems. Additionally, we build a universal integer weighted automaton where the automaton is fixed and the word problem is undecidable.作者: OFF 時間: 2025-3-25 07:12 作者: 不要嚴酷 時間: 2025-3-25 11:03
State Complexity of Projection on?Languages Recognized by Permutation Automata and Commuting Letters . states. Up to now, these, and finite languages projected onto unary languages, were the only classes of automata known to possess this property. We show that this is also true for commutative automata and we find commutative automata that are not state-partition automata.作者: 勉勵 時間: 2025-3-25 14:02
Conference proceedings 2021ugal, during August 16-20, 2021. The conference took place in an hybrid format with both in-person and online participation..The 27 full papers included in these proceedings were carefully reviewed and selected from 48 submissions. The DLT conference series provides a forum for presenting current de作者: EXUDE 時間: 2025-3-25 19:38
Pointlike Sets and Separation: A Personal Perspectivef separation and covering problems, have become very popular now in Computer Science because of the truly amazing work of Place and Zeitoun on dot-depth and related hierarchies. I believe revisiting some of the older results will revive interest and provide perspective.作者: 木質 時間: 2025-3-25 20:27 作者: ALTER 時間: 2025-3-26 02:20
Variations on the Post Correspondence Problem for Free Groupsectivity assumptions, we prove that computing the rank of the equaliser of a pair of free group homomorphisms can be applied to computing a basis of this equaliser, and also to solve the “generalised” Post Correspondence Problem for free groups.作者: 話 時間: 2025-3-26 08:08 作者: 軟弱 時間: 2025-3-26 12:14 作者: laceration 時間: 2025-3-26 16:35 作者: 兇殘 時間: 2025-3-26 16:52 作者: CAND 時間: 2025-3-27 00:57 作者: Ceramic 時間: 2025-3-27 04:26 作者: 偽造者 時間: 2025-3-27 06:11 作者: Lacerate 時間: 2025-3-27 11:54 作者: wreathe 時間: 2025-3-27 13:47 作者: dyspareunia 時間: 2025-3-27 19:11
Lecture Notes in Computer Science it in a specific point and inserting suitable Dyck paths (not too long...) in this cutting point. Then, we increase the cardinality of the set by replacing the first and the second factor of the original elevated Dyck path with suitable sets of prefixes and suffixes.作者: 向前變橢圓 時間: 2025-3-27 22:31 作者: BLOT 時間: 2025-3-28 02:54
Masaaki Kurosu,Ayako Hashizume,Yuuki Uenonger?2011] is confirmed. It is demonstrated that the composition of a constant weighted extended tree transducer with a linear weighted top-down tree transducer can be computed by a single weighted extended tree transducer. Whereas linearity and the top-down property are syntactic, the constant prop作者: 擴音器 時間: 2025-3-28 06:55
Augmentation and the Visual Mindh partial transition function) can have exponentially large reset thresholds. This is still true if we restrict to binary PFAs. However, asymptotics do not give conclusions for fixed .. We prove that the maximal reset threshold for binary PFAs is strictly greater than . if and only if ...These resul作者: RAFF 時間: 2025-3-28 10:43
Carl M. Olsson,Jeanette Erikssonriations of this classical problem, but in the setting of free groups and free group homomorphisms. Among other results, and working under certain injectivity assumptions, we prove that computing the rank of the equaliser of a pair of free group homomorphisms can be applied to computing a basis of t作者: stratum-corneum 時間: 2025-3-28 16:46
Green IS in Education Industry: A Case Studylly-testable (SLT) language of order 2. The family of recognizable picture languages is also defined, using larger . by . tiles, ., by the projection of the corresponding SLT language. A basic measure of the descriptive complexity of a picture language is given by the size of the SLT alphabet using 作者: 同步信息 時間: 2025-3-28 21:04 作者: 疲勞 時間: 2025-3-29 02:09
Grounding of Concept, Indexical, and Name different types to freely commute. We show that balanced regular and .-regular languages can be characterised by syntactic constraints on regular and .-regular expressions and, using the shuffle on trajectories operator, we define grammars for balanced-by-construction expressions with which one can作者: Substance 時間: 2025-3-29 03:15 作者: CHIDE 時間: 2025-3-29 09:18 作者: heterogeneous 時間: 2025-3-29 13:57
Haidong Li,Hai-Lin Liu,Xueyi Liangeighted automata on infinite words and study the universality and the emptiness problems under zero weight acceptance. We show that the universality problem is undecidable for three-state automata by a direct reduction from the .. We also consider other more general acceptance conditions as well as 作者: Irrigate 時間: 2025-3-29 18:06
Lecture Notes in Computer Scienceidden patterns for deterministic automata (finite words) and for Carton-Michel automata (infinite words). In order to give concise patterns, we allow the use of subwords on paths in finite graphs. This concept is formalized as subword patterns. Deciding the presence or absence of such a pattern in a作者: CALL 時間: 2025-3-29 23:09
Bong-gyu Jang,Myonghee Lee,Gerard J. Kimthe number of states incident to unobservable non-loop transitions, and this bound is best possible. Here, we derive the tight bound . for permutation automata. For a state-partition automaton with . states (also called automata with the observer property) the projected language is recognizable with作者: tinnitus 時間: 2025-3-30 01:20
Wan-Ling Chang,Ting-Yi Wu,Yu-Hsiu Hunghis type, the problem is always in .. Furthermore, we give a full classification of the realizable complexities for constraint automata with at most two states and over a ternary alphabet. We find that most constrained problems that are .-complete in general become .-complete. However, there also ex作者: Affectation 時間: 2025-3-30 05:53
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/270222.jpg作者: 糾纏 時間: 2025-3-30 11:35
Developments in Language Theory978-3-030-81508-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 尾巴 時間: 2025-3-30 16:16 作者: 我吃花盤旋 時間: 2025-3-30 17:57 作者: blight 時間: 2025-3-31 00:09
Xiaoli Fan,Huimin Hu,Chaoyi Zhao,Wei ZhangTwo classical families of infinite sequences with some regularity properties are the families of . and of . sequences. After recalling their definitions, we survey some recent work trying to “separate” between them.作者: 改革運動 時間: 2025-3-31 03:28
Xiaoli Fan,Huimin Hu,Chaoyi Zhao,Wei ZhangThroughout the history of Formal Languages, one of the research directions has always been to describe computational completeness using only a small amount of possibly scarce resources. We review some of these results in the form of an essay.作者: Nuance 時間: 2025-3-31 05:33
Morphic Sequences Versus Automatic SequencesTwo classical families of infinite sequences with some regularity properties are the families of . and of . sequences. After recalling their definitions, we survey some recent work trying to “separate” between them.作者: 前兆 時間: 2025-3-31 11:09
Parsimonious Computational CompletenessThroughout the history of Formal Languages, one of the research directions has always been to describe computational completeness using only a small amount of possibly scarce resources. We review some of these results in the form of an essay.作者: 努力趕上 時間: 2025-3-31 16:27 作者: 引起痛苦 時間: 2025-3-31 21:01
