作者: 不透明 時(shí)間: 2025-3-21 21:06 作者: ironic 時(shí)間: 2025-3-22 00:30
,Automated Search for G?del’s Proofs,del theory and profinite topology. This paper surveys research advances on this topic over the last fifty years..The concatenation product plays a key role in two of the most important results of automata theory: Kleene’s theorem on regular languages [23] and Schützenberger’s theorem on star-free la作者: 殺死 時(shí)間: 2025-3-22 06:11 作者: 馬籠頭 時(shí)間: 2025-3-22 11:21
Program Transformation and Compilation on two known conditions necessarily satisfied by a recognizable language, that are based on the idea to reduce the problem from picture to string languages. We emphasize that they are grounded on two lower bound techniques for regular string languages. Starting from a stronger lower bound, named th作者: Interlocking 時(shí)間: 2025-3-22 13:11 作者: intrigue 時(shí)間: 2025-3-22 20:53
Nathan Wasser,Reiner H?hnle,Richard Bubelures, as tactical configurations and balanced incomplete block designs (BIBDs) naturally arise when considering the class of planar and circular nearrings. In [12] the authors define the concept of disk and prove that in the case of field-generated planar circular nearrings it yields a BIBD, called 作者: Seminar 時(shí)間: 2025-3-23 00:46
Nathan Wasser,Reiner H?hnle,Richard Bubel that the multiplier (i.e. the factor . in the differential equation .?=?.) has only singularities of first order (Fuchsian-type equations) and this implies that they freely span a space which contains no primitive. We give direct applications where we extend the property of linear independence to t作者: 撫育 時(shí)間: 2025-3-23 03:00 作者: agglomerate 時(shí)間: 2025-3-23 08:36 作者: Intentional 時(shí)間: 2025-3-23 10:35
https://doi.org/10.1007/978-3-030-64354-6m rewrite systems and finite canonical word rewrite systems for only a very limited number of those varieties. We present a finite canonical conditional word rewrite system for a particular variety in which the classical approaches cannot be applied. Moreover, we obtain infinite single letter deleti作者: 仔細(xì)閱讀 時(shí)間: 2025-3-23 15:57 作者: 刪除 時(shí)間: 2025-3-23 18:28 作者: Cholagogue 時(shí)間: 2025-3-24 00:11 作者: Incumbent 時(shí)間: 2025-3-24 05:22
Lecture Notes in Computer Scienceanked alphabet containing variable symbols. The underlying tree automaton computes its tree language, and then replaces the variable symbols with symbols from the infinite alphabet following certain rules. We show that the class of recognizable tree languages over infinite ranked alphabets is closed作者: concentrate 時(shí)間: 2025-3-24 08:37 作者: 莊嚴(yán) 時(shí)間: 2025-3-24 13:27
An Algorithm for Computing a Basis of a Finite Abelian GroupIn this paper we consider the problem of computation of a basis for a finite abelian group . with . elements. We present a deterministic algorithm such that given a generating set for . and the prime factorization of ., it computes a basis of ..作者: ARCH 時(shí)間: 2025-3-24 15:40 作者: 易于出錯 時(shí)間: 2025-3-24 22:11 作者: 沒花的是打擾 時(shí)間: 2025-3-24 23:48 作者: Anticoagulant 時(shí)間: 2025-3-25 04:24 作者: Indict 時(shí)間: 2025-3-25 10:19
Lecture Notes in Computer Scienceer, the formalism is very permissive, which makes it hard to obtain results; consequently, techniques are often restricted to a subclass. In this paper we study termination-preserving transformations to make AFS-programs adhere to a number of standard properties. This makes it significantly easier to obtain general termination results.作者: engrossed 時(shí)間: 2025-3-25 13:25
Lecture Notes in Computer Sciencefor real algebra. We consider a real algebraic decision procedure computing all realizable sign conditions of a set of polynomials. We modify this procedure so that it satisfies certain requirements needed for the embedding into an SMT-solver.作者: 消耗 時(shí)間: 2025-3-25 19:00
Franz WinklerFast track conference proceedings.Unique visibility.State of the art research作者: FRET 時(shí)間: 2025-3-25 22:19
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/152639.jpg作者: 胰島素 時(shí)間: 2025-3-26 01:00 作者: 阻塞 時(shí)間: 2025-3-26 04:40
978-3-642-21492-9Springer Berlin Heidelberg 2011作者: Vertebra 時(shí)間: 2025-3-26 10:34 作者: jet-lag 時(shí)間: 2025-3-26 12:42 作者: Phonophobia 時(shí)間: 2025-3-26 20:19 作者: cajole 時(shí)間: 2025-3-26 23:25 作者: 裁決 時(shí)間: 2025-3-27 05:10 作者: metropolitan 時(shí)間: 2025-3-27 07:03 作者: 人工制品 時(shí)間: 2025-3-27 11:27 作者: 抗生素 時(shí)間: 2025-3-27 15:12 作者: LINE 時(shí)間: 2025-3-27 21:29
Lecture Notes in Computer Scienceear to be useful in this context, leading to structural results on ...Here we survey some work of this type. At the end of the paper a new application of this kind is presented: an algebraic characterization of shattering-extremal families and a fast algorithm to recognize them.作者: 催眠藥 時(shí)間: 2025-3-28 01:24 作者: ACE-inhibitor 時(shí)間: 2025-3-28 04:13
https://doi.org/10.1007/978-3-030-64354-6al word rewrite system for a particular variety in which the classical approaches cannot be applied. Moreover, we obtain infinite single letter deleting rewrite systems for each join-irreducible variety.作者: hardheaded 時(shí)間: 2025-3-28 07:57
Lecture Notes in Computer Scienceces thus providing the necessary structures to describe a two-part secret-sharing scheme based on Hadamard designs. Furthermore, we exhibit how some algebraic aspects of secret-sharing cryptography are interpreted in terms of combinatorial design theory, such as the access structure and the security of the secret-sharing schemes.作者: theta-waves 時(shí)間: 2025-3-28 13:56
Some Combinatorial Applications of Gr?bner Basesear to be useful in this context, leading to structural results on ...Here we survey some work of this type. At the end of the paper a new application of this kind is presented: an algebraic characterization of shattering-extremal families and a fast algorithm to recognize them.作者: MILK 時(shí)間: 2025-3-28 17:57
,-Rank-Width of (Edge-Colored) Graphs extend most of the results known for the rank-width of undirected graphs to the .-rank-width of graphs: cubic-time recognition algorithm, characterisation by excluded configurations under . and ., and algebraic characterisation by graph operations. We also show that the rank-width of undirected graphs is a special case of .-rank-width.作者: BILE 時(shí)間: 2025-3-28 20:22 作者: Perceive 時(shí)間: 2025-3-29 02:16
Hadamard Matrices, Designs and Their Secret-Sharing Schemesces thus providing the necessary structures to describe a two-part secret-sharing scheme based on Hadamard designs. Furthermore, we exhibit how some algebraic aspects of secret-sharing cryptography are interpreted in terms of combinatorial design theory, such as the access structure and the security of the secret-sharing schemes.作者: 凹槽 時(shí)間: 2025-3-29 04:54 作者: 無法破譯 時(shí)間: 2025-3-29 07:51
0302-9743 graphs arrays, etc. decision problems, algebraic characterization of logical theories, process algebra, algebraic algorithms, algebraic coding theory, and algebraic aspects of cryptography.978-3-642-21492-9978-3-642-21493-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 易于交談 時(shí)間: 2025-3-29 11:59 作者: hypnogram 時(shí)間: 2025-3-29 18:02
Nathan Wasser,Reiner H?hnle,Richard Bubel partially incomplete block designs (PBIBDs). Such designs can be used in the construction of some classes of codes for which we are able to calculate the parameters and to prove that in some cases they are also cyclic.作者: Dignant 時(shí)間: 2025-3-29 21:55
Lecture Notes in Computer Scienceal subclasses of variable tree automata. The universality problem is also decidable in a subclass of variable tree automata. We demonstrate the robustness of our model by connecting it to variable finite automata and indicating several characterizations of recognizable tree languages over infinite ranked alphabets.作者: cardiopulmonary 時(shí)間: 2025-3-30 02:14 作者: 有角 時(shí)間: 2025-3-30 04:30 作者: incision 時(shí)間: 2025-3-30 10:28 作者: 情節(jié)劇 時(shí)間: 2025-3-30 14:47
Program Transformation and Compilatione nondeterministic message complexity technique, we are able to state a new necessary condition for the recognizability of two-dimensional languages. We compare the three conditions and find that the new one extends the previous two yielding a greater accuracy.作者: 不開心 時(shí)間: 2025-3-30 19:28
Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems the natural numbers are known to induce polynomial upper bounds on the derivational complexity of (compatible) rewrite systems. Recently two different improvements were proposed, based on the theory of weighted automata and linear algebra. In this paper we strengthen and unify these improvements by作者: 木訥 時(shí)間: 2025-3-30 22:40
From Grammars and Automata to Algebras and Coalgebrasr hardware model is constructor- or destructor-based, a . or a . model. A highly-structured system may involve both constructor- and destructor-based components. The two model classes and the respective ways of developing them and reasoning about them are dual to each other. Roughly said, algebras g作者: labile 時(shí)間: 2025-3-31 01:18 作者: 慢慢啃 時(shí)間: 2025-3-31 07:09
Some Combinatorial Applications of Gr?bner Basesns on .. To study these, one often considers .(.), the vanishing ideal of . in the polynomial ring .. Gr?bner bases and standard monomials of .(.) appear to be useful in this context, leading to structural results on ...Here we survey some work of this type. At the end of the paper a new application作者: CHIDE 時(shí)間: 2025-3-31 11:05 作者: collagen 時(shí)間: 2025-3-31 16:18 作者: 擁護(hù)者 時(shí)間: 2025-3-31 19:10 作者: Ccu106 時(shí)間: 2025-4-1 01:36
Independence of Hyperlogarithms over Function Fields via Algebraic Combinatorics that the multiplier (i.e. the factor . in the differential equation .?=?.) has only singularities of first order (Fuchsian-type equations) and this implies that they freely span a space which contains no primitive. We give direct applications where we extend the property of linear independence to t作者: 責(zé)難 時(shí)間: 2025-4-1 03:48
Quantifier Elimination over Finite Fields Using Gr?bner?Basesm relies on the strong Nullstellensatz and properties of elimination ideals over finite fields. We analyze the theoretical complexity of the algorithm and show its application in the formal analysis of a biological controller model.作者: 和諧 時(shí)間: 2025-4-1 08:05 作者: Asseverate 時(shí)間: 2025-4-1 12:40
Rewriting in Varieties of Idempotent Semigroupsm rewrite systems and finite canonical word rewrite systems for only a very limited number of those varieties. We present a finite canonical conditional word rewrite system for a particular variety in which the classical approaches cannot be applied. Moreover, we obtain infinite single letter deleti作者: 試驗(yàn) 時(shí)間: 2025-4-1 14:54
