Sciweavers

1705 search results - page 21 / 341
» Representing Constraints with Automata
Sort
View
69
Voted
FSTTCS
2008
Springer
14 years 10 months ago
An Optimal Construction of Finite Automata from Regular Expressions
We consider the construction of finite automata from their corresponding regular expressions by a series of digraph-transformations along the expression’s structure. Each interm...
Stefan Gulan, Henning Fernau
ENTCS
2002
91views more  ENTCS 2002»
14 years 9 months ago
Interval Duration Logic: Expressiveness and Decidability
We investigate a variant of dense-time Duration Calculus which permits model checking using timed/hybrid automata. We define a variant of the Duration Calculus, called Interval Du...
Paritosh K. Pandya
ISAAC
2003
Springer
144views Algorithms» more  ISAAC 2003»
15 years 2 months ago
Biconnectivity on Symbolically Represented Graphs: A Linear Solution
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
Raffaella Gentilini, Alberto Policriti
ICRA
2009
IEEE
81views Robotics» more  ICRA 2009»
15 years 4 months ago
Representing sets of orientations as convex cones
— In a wide range of applications the orientation of a rigid body does not need to be restricted to one given orientation, but can be given as a continuous set of frames. We addr...
Pål Johan From, Jan Tommy Gravdahl
EMISA
2005
Springer
15 years 3 months ago
Representing Generalization/Specialization in XML Schema
: XML is an effective universal data-interchange format, and XML Schema has become the preeminent mechanism for describing valid XML document structures. Generalization/specializat...
Reema Al-Kamha, David W. Embley, Stephen W. Liddle