Sciweavers

2018 search results - page 175 / 404
» Code Normal Forms
Sort
View
CORR
2010
Springer
132views Education» more  CORR 2010»
15 years 2 months ago
Small NFAs from Regular Expressions: Some Experimental Results
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...
Hugo Gouveia, Nelma Moreira, Rogério Reis
122
Voted
ENTCS
2008
100views more  ENTCS 2008»
15 years 2 months ago
Model-based Engineering of Embedded Systems Using the Hybrid Process Algebra Chi
Hybrid Chi is a process algebra for the modeling and analysis of hybrid systems. It enables modular specification of hybrid systems by means of a large set of atomic statements an...
Jos C. M. Baeten, Dirk A. van Beek, Pieter J. L. C...
CORR
2006
Springer
104views Education» more  CORR 2006»
15 years 2 months ago
From Proof Nets to the Free *-Autonomous Category
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
François Lamarche, Lutz Straßburger
CSJM
2006
81views more  CSJM 2006»
15 years 2 months ago
Nash equilibria set computing in finite extended games
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...
Valeriu Ungureanu
DAM
2006
136views more  DAM 2006»
15 years 2 months ago
The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization,
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...
Taneli Mielikäinen, Esko Ukkonen