设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
CNKI学位论文(121)
知网期刊论文(26)
在“
Elsevier电子期刊
”中,
命中:
156
条,耗时:0.0130215 秒
在所有数据库中总计命中:
147
条
1.
Toward a theory of input-driven locally parsable
languages
作者:
Stefano Crespi Reghizzi
a
;
c
;
stefano.crespireghizzi@polimi.it
;
Violetta Lonati
b
;
lonati@di.unimi.it
;
Dino Mandrioli
a
;
dino.mandrioli@polimi.it
;
Matteo Pradella
a
;
c
;
matteo.pradella@polimi.it
关键词:
Operator precedence
languages
;
Input-driven
languages
;
Visibly pushdown
languages
;
Parallel parsing
刊名:Theoretical Computer Science
出版年:2017
2.
The emptiness problem for tree automata with at least one global disequality constraint is NP-hard
作者:
P.-C. Hé
;
am
a
;
pheam@femto-st.fr" class="auth_mail" title="E-mail the corresponding author
;
V. Hugot
b
;
O. Kouchnarenko
a
关键词:
Formal
languages
;
Tree automata
;
Algorithms
刊名:Information Processing Letters
出版年:2017
3.
Efficient algorithms for membership in boolean hierarchies of regular
languages
作者:
Christian Glaß
;
er
a
;
glasser@informatik.uni-wuerzburg.de" class="auth_mail" title="E-mail the corresponding author
;
Heinz Schmitz
b
;
h.schmitz@hochschule-trier.de" class="auth_mail" title="E-mail the corresponding author
;
Victor Selivanov
c
;
1
;
vseliv@iis.nsk.su" class="auth_mail" title="E-mail the corresponding author
关键词:
Automata and formal
languages
;
Computational complexity
;
Dot-depth hierarchy
;
Boolean hierarchy
;
Decidability
;
Efficient algorithms
刊名:Theoretical Computer Science
出版年:2016
4.
Ordered multi-stack visibly pushdown automata
作者:
Dario Carotenuto
;
Aniello Murano
;
aniello.murano@unina.it
;
Adriano Peron
adrperon@unina.it
关键词:
Visibly automata
;
Formal verification
;
Model checking
;
Pushdown automata
;
Automata-theoretic approach to system verification
;
Formal
languages
刊名:Theoretical Computer Science
出版年:2016
5.
Timed recursive state machines: Expressiveness and complexity
作者:
Massimo Benerecetti
;
massimo.benerecetti@unina.it" class="auth_mail" title="E-mail the corresponding author
;
Adriano Peron
adrperon@unina.it" class="auth_mail" title="E-mail the corresponding author
关键词:
Formal
languages
;
Formal models of computing
;
Timed automata
;
Real-time systems
;
Pushdown systems
;
Recursive state machines
刊名:Theoretical Computer Science
出版年:2016
6.
The complexity of higher-order queries
作者:
Michael Benedikt
a
;
michael.benedikt@cs.ox.ac.uk" class="auth_mail" title="E-mail the corresponding author
;
Gabriele Puppis
b
;
gabriele.puppis@labri.fr" class="auth_mail" title="E-mail the corresponding author
;
Huy Vu
c
;
qhuyvu@gmail.com" class="auth_mail" title="E-mail the corresponding author
刊名:Information and Computation
出版年:2015
7.
Branching-time logics with path relativisation
作者:
Markus Latte
;
Martin Lange
关键词:
Temporal logic
;
CTL鈦?/sup>
;
Formal
languages
;
Expressive power
;
Model checking
;
Satisfiability
刊名:Journal of Computer and System Sciences
出版年:March, 2014
8.
Regular
languages
and partial commutations
作者:
Antonio Cano
;
Giovanna Guaiana
;
Jean-¨¦ric Pin
关键词:
Regular language
;
Partial commutation
;
Trace language
;
Shuffle
;
Variety of
languages
刊名:Information and Computation
出版年:2013
9.
A note on algebras of
languages
作者:
Claudio
;
Marini
a
;
;
marinic@unisi.it
;
Giulia
;
Simi
a
;
;
simi@unisi.it
;
Andrea
;
Sorbi
;
;
;
a
;
;
sorbi@unisi.it
;
Marianna
;
Sorrentino
a
关键词:
Regular
languages
;
Context-sensitive
languages
;
Decidable
languages
;
Boolean algebras
;
Algebras of
languages
;
Fré
;
chet ideal
刊名:Theoretical Computer Science
出版年:2011
10.
Rewriting preserving recognizability of finite tree
languages
作者:
Sá
;
ndor Vá
;
gvö
;
lgyi
vagvolgy@inf.u-szeged.hu
关键词:
Term rewrite systems
;
Tree automata
;
Preservation of recognizability
刊名:Journal of Logic and Algebraic Programming
出版年:2013
1
2
3
4
5
6
7
8
9
按检索点细分(156)
题名(4)
关键词(1)
文摘(119)
按出版年细分(156)
2027年及以后(1)
2017年(2)
2016年(3)
2015年(1)
2013年(5)
2012年(6)
2011年(6)
2010年(12)
2009年(6)
2008年(10)
2007年(7)
2006年(9)
2005年(18)
2004年(8)
2003年(11)
2002年(8)
2001年(9)
2000年(1)
2000年及以前(33)
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
.