找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Machines, Computations, and Universality; 4th International Co Maurice Margenstern Conference proceedings 2005 Springer-Verlag Berlin Heide

[復制鏈接]
樓主: malcontented
21#
發(fā)表于 2025-3-25 04:46:05 | 只看該作者
Ordering and Convex Polyominoesies of special families of discrete sets (corresponding to {0,1}-matrices) with respect to this partial order. In particular we consider the families of polyominoes and convex polyominoes and the family, recently introduced by the authors, of L-convex polyominoes..In the first part of the paper we s
22#
發(fā)表于 2025-3-25 11:09:31 | 只看該作者
23#
發(fā)表于 2025-3-25 12:43:51 | 只看該作者
24#
發(fā)表于 2025-3-25 19:29:09 | 只看該作者
25#
發(fā)表于 2025-3-25 20:22:42 | 只看該作者
26#
發(fā)表于 2025-3-26 00:23:56 | 只看該作者
27#
發(fā)表于 2025-3-26 08:12:25 | 只看該作者
Sequential P Systems with Unit Rules and Energy Assigned to Membranesin the area of membrane systems) and, moreover, every membrane carries an energy value that can be changed during a computation by objects passing through the membrane. For the application of rules leading from one configuration of the system to the succeeding configuration we consider a sequential
28#
發(fā)表于 2025-3-26 12:04:35 | 只看該作者
Hierarchies of DLOGTIME-Uniform Circuitsy a family of .-uniform circuits of depth?. and size . but not by any family of .-uniform circuits of depth?. and size?., where .>?0, .>0, ..>1, and ..≥1 are arbitrary rational constants. It is also shown that there is a language which can be recognized by a family of .-uniform circuits of depth?(1+
29#
發(fā)表于 2025-3-26 16:07:50 | 只看該作者
Several New Generalized Linear- and Optimum-Time Synchronization Algorithms for Two-Dimensional Rectd its 14-state implementation are given. It is shown that there exists a 14-state 2-D CA that can synchronize any . × . rectangular array in . + . + max(. + . , . + . – . – . + 2) – 4 steps with the general at an arbitrary initial position (., .),where 1 ≤ . ≤ ., 1 ≤ . ≤ .. The generalized linear-ti
30#
發(fā)表于 2025-3-26 18:28:18 | 只看該作者
Register Complexity of LOOP -, WHILE -, and GOTO -Programsunctions from the non-negative integers to the non-negative integers. It turns out that the hierarchy of .-computable (.-, and .-computable, respectively) functions .:?. →?. (partial functions ., respectively) that is induced by the number of registers collapses to a fixed level. In all three cases
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-7 16:37
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復 返回頂部 返回列表
襄汾县| 宁波市| 陕西省| 定远县| 锡林郭勒盟| 永靖县| 思南县| 乐山市| 赣榆县| 苏州市| 高雄县| 永济市| 红河县| 清远市| 密云县| 来凤县| 衡水市| 米林县| 抚顺市| 儋州市| 青铜峡市| 波密县| 瑞丽市| 天镇县| 牡丹江市| 南平市| 象山县| 山东| 瑞昌市| 大渡口区| 壤塘县| 兴安盟| 乐清市| 太和县| 涞水县| 外汇| 保山市| 西乡县| 磐石市| 桦川县| 河津市|