4502 search results - page 244 / 901 » Regular Model Checking |
175
click to vote
ADBIS
2000
Springer
15 years 10 months ago
2000
Springer
In this paper we describe an approach to representation of data and knowledge using two technologies: XML and regular expressions in a domain of natural language syntactic analysis...
156
click to vote
AUTOMATICA
2005
15 years 6 months ago
2005
This paper presents an algorithm for robust optimal control of regular languages under specified uncertainty bounds on the event cost parameters of the language measure that has b...
201
click to vote
SBMF
2010
Springer
15 years 1 months ago
2010
Springer
A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene's theorem and Kleene algebra, were recently proposed ...
194
click to vote
TMI
2010
15 years 1 months ago
2010
Abstract--Reconstruction algorithms for fluorescence tomography have to address two crucial issues : (i) the ill-posedness of the reconstruction problem, (ii) the large scale of nu...
163
click to vote
ENTCS
2007
15 years 6 months ago
2007
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...