Sciweavers

81 search results - page 9 / 17
» A Formalisation of Finite Automata Using Hereditarily Finite...
Sort
View
LACL
1998
Springer
15 years 2 months ago
Lambek Calculus Proofs and Tree Automata
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...
Hans-Jörg Tiede
ICDCS
2009
IEEE
15 years 8 months ago
Characterization and Solution to a Stateful IDS Evasion
We identify a new type of stateful IDS evasion, named signature evasion. We formalize the signature evasion on those Stateful IDSs whose state can be modeled using Deterministic F...
Issam Aib, Tung Tran, Raouf Boutaba
PTS
2007
99views Hardware» more  PTS 2007»
15 years 19 days ago
Testing Input/Output Partial Order Automata
Abstract. We propose an extension of the Finite State Machine framework in distributed systems, using input/output partial order automata (IOPOA). In this model, transitions can be...
Stefan Haar, Claude Jard, Guy-Vincent Jourdan
TCS
2008
14 years 11 months ago
Kernel methods for learning languages
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
EUROMICRO
2009
IEEE
15 years 3 months ago
Formal Semantics of the ProCom Real-Time Component Model
ProCom is a new component model for real-time and embedded systems, targeting the domains of vehicular and telecommunication systems. In this paper, we describe how the architectur...
Aneta Vulgarakis, Jagadish Suryadevara, Jan Carlso...