设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
Springer电子图书(1)
SpringerLink电子期刊(33)
ProQuest学位论文(1)
Elsevier电子期刊(12)
在“
Elsevier电子期刊
”中,
命中:
12
条,耗时:0.0259883 秒
在所有数据库中总计命中:
47
条
1.
Operational state complexity of unary NFAs with finite
nondeterminism
作者:
Alexandros Palioudakis
a
;
alex@cs.yonsei.ac.kr" class="auth_mail" title="E-mail the corresponding author
;
Kai Salomaa
b
;
ksalomaa@cs.queensu.ca" class="auth_mail" title="E-mail the corresponding author
;
Selim G. Akl
b
;
akl@cs.queensu.ca" class="auth_mail" title="E-mail the corresponding author
关键词:
Finite automata
;
Limited
nondeterminism
;
State complexity
;
Language operations
;
Unary regular languages
;
Descriptional complexity
刊名:Theoretical Computer Science
出版年:2016
2.
Regulated
nondeterminism
in pushdown automata
作者:
Martin Kutrib
;
Andreas Malcher
;
Larissa Werlein
关键词:
Pushdown automata
;
Limited
nondeterminism
;
Context-dependent
nondeterminism
;
Computational capacity
;
Closures of languages
;
Context-free languages
刊名:Theoretical Computer Science
出版年:2009
3.
On probabilistic pushdown automata
作者:
Juraj Hromkovič
;
Georg Schnitger
关键词:
Pushdown automata
;
Determinism
;
Nondeterminism
;
Randomization
刊名:Information and Computation
出版年:2010
4.
Computational aspects of monotone dualization: A brief survey
作者:
Thomas Eiter
;
Kazuhisa Makino
;
Georg Gottlob
关键词:
Dualization
;
Monotone Boolean functions
;
Hypergraphs
;
Transversals
;
Hitting sets
;
Independent sets
;
Set coverings
;
Self-duality
;
Output-polynomial algorithms
;
Polynomial-total time
;
Quasi-polynomial time
;
Combinatorial enumeration
;
Limited
nondeterminism
刊名:Discrete Applied Mathematics
出版年:2008
5.
Context-dependent
nondeterminism
for pushdown automata
作者:
Martin Kutrib
;
Andreas Malcher
关键词:
Deterministic pushdown automata
;
Computational capacity
;
Time-efficient recognizers
;
Closures of languages
;
Context-free languages
刊名:Theoretical Computer Science
出版年:2007
6.
Bounded fixed-parameter tractability and nondeterministic bits
作者:
Jö
;
rg Flum
;
Martin Grohe and Mark Weyer
关键词:
Fixed-parameter tractability
;
Limited
nondeterminism
刊名:Journal of Computer and System Sciences
出版年:2006
7.
Communication Complexity Method for Measuring
Nondeterminism
in Finite Automata
作者:
Hromkovic
;
Juraj
;
Seibert
;
Sebastian
;
Karhumä
;
ki
;
Juhani
;
Klauck
;
Hartmut
;
Schnitger
;
Georg
关键词:
finite automata
;
nondeterminism
;
limited
ambiguity
;
descriptional complexity
;
communication complexity
刊名:Information and Computation
出版年:2002
8.
Minimizing finite automata is computationally hard
作者:
Malcher
;
Andreas
关键词:
Finite automata
;
Limited
nondeterminism
;
Minimization
;
Formula Not Shown
-complete
刊名:Theoretical Computer Science
出版年:2004
9.
The Minimum Equivalent DNF Problem and Shortest Implicants
作者:
Umans
;
Christopher
刊名:Journal of Computer and System Sciences
出版年:2001
10.
On
Limited
Nondeterminism
and the Complexity of the V-C Dimension
作者:
Papadimitriou
;
Christos H.
;
Yannakakis
;
Mihalis
刊名:Journal of Computer and System Sciences
出版年:1996
1
2
按检索点细分(12)
题名(1)
关键词(6)
文摘(6)
按出版年细分(12)
2016年(1)
2010年(1)
2009年(1)
2008年(1)
2007年(1)
2006年(1)
2004年(1)
2002年(1)
2001年(1)
2000年及以前(3)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via
email
.