找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

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

打印 上一主題 下一主題

Titlebook: Language and Automata Theory and Applications; 6th International Co Adrian-Horia Dediu,Carlos Martín-Vide Conference proceedings 2012 Sprin

[復(fù)制鏈接]
樓主: choleric
21#
發(fā)表于 2025-3-25 05:30:34 | 只看該作者
Measuring Information in Timed Languagespplications to computer-aided verification. However the theory of timed regular languages is far from being achieved. Seven years ago, in [2], I argued that developing such a theory constituted an important research challenge, and I sketched a research program in this direction. Unfortunately, when
22#
發(fā)表于 2025-3-25 11:25:01 | 只看該作者
The Computer Science of DNA Nanotechnologying at atomic and molecular scales. This field is now a rapidly growing interdisciplinary research adventure involving chemists, molecular biologists, computer scientists, materials scientists, electrical and computer engineers, and others. DNA tile assembly, DNA origami, and DNA strand displacement
23#
發(fā)表于 2025-3-25 14:42:18 | 只看該作者
24#
發(fā)表于 2025-3-25 17:38:15 | 只看該作者
25#
發(fā)表于 2025-3-25 22:54:59 | 只看該作者
Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits .(..,..,…,..) and .(..,..,…,..) differ on at most an . fraction of all Boolean inputs {0,1}.. We give a randomized . algorithm that computes a .-approximate isomorphism between two isomorphic Boolean functions . and . that are given by depth . circuits of poly(.) size, where . is a constant indepen
26#
發(fā)表于 2025-3-26 00:23:18 | 只看該作者
Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Spacemplexity classes, respectively. Recently, Morita introduced . multi-head finite automata (RMFAs), and posed the question of whether RMFAs characterize reversible logarithmic space as well. Here, we resolve the question affirmatively, by exhibiting a clean RMFA simulation of logarithmic space reversi
27#
發(fā)表于 2025-3-26 07:25:24 | 只看該作者
28#
發(fā)表于 2025-3-26 11:25:16 | 只看該作者
Longest Common Extensions via Fingerprinting ..(.,.), is the length of the longest common prefix of the pair of suffixes starting at index . and . in the string .. The LCE problem can be solved in linear space with constant query time and a preprocessing of sorting complexity. There are two known approaches achieving these bounds, which use n
29#
發(fā)表于 2025-3-26 13:50:42 | 只看該作者
Fast and Cache-Oblivious Dynamic Programming with Local Dependencieskey task (and often computational bottleneck) in large-scale textual information retrieval. For instance, algorithms for sequence alignment are widely used in bioinformatics to compare DNA and protein sequences. These problems can all be solved using essentially the same dynamic programming scheme o
30#
發(fā)表于 2025-3-26 19:17:58 | 只看該作者
An Efficient Implicit OBDD-Based Algorithm for Maximal Matchingsem and algorithms for maximal matchings have been used as submodules for problems like maximal node-disjoint paths or maximum flow. Since in some applications graphs become larger and larger, a research branch has emerged which is concerned with the design and analysis of implicit algorithms for cla
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-8 02:55
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
广河县| 榆中县| 青神县| 遂昌县| 虞城县| 锡林浩特市| 鄢陵县| 根河市| 沙河市| 濮阳市| 长乐市| 霍山县| 石家庄市| 饶河县| 桓仁| 镇坪县| 沙坪坝区| 巧家县| 三明市| 大理市| 罗田县| 日土县| 丹江口市| 迭部县| 南投县| 固镇县| 文昌市| 卓尼县| 禹城市| 会理县| 松江区| 云梦县| 邵武市| 调兵山市| 贺州市| 揭东县| 西乡县| 通州区| 收藏| 临夏市| 新闻|