218 search results - page 32 / 44 » Finite Trees as Ordinals |
CAV
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—Dictionary-Based String Matching (DBSM) is used in network Deep Packet Inspection (DPI) applications virus scanning [1] and network intrusion detection [2]. We propose the Pipel...
ACL
1990
14 years 11 months ago
1990
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...
TCS
2008
14 years 9 months ago
2008
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
ENTCS
2002
14 years 9 months ago
2002
The paper discusses the hierarchy of indices of finite automata over infinite objects. This hierarchy corresponds exactly to the hierarchy of alternations of least and greatest fi...