Sciweavers

233 search results - page 32 / 47
» Equivalent Transformations of Automata by Using Behavioural ...
Sort
View
DM
2008
94views more  DM 2008»
13 years 8 months ago
Discrete transformation hypergroups and transformation hypergroups with phase tolerance space
Tolerance spaces and algebraic structures with compatible tolerances play an important role in contemporary algebra and their applications. In this contribution we are presenting ...
Sárka Hosková, Jan Chvalina
ICALP
2007
Springer
14 years 2 months ago
Minimum-Time Reachability in Timed Games
Abstract. We consider the minimum-time reachability problem in concurrent two-player timed automaton game structures. We show how to compute the minimum time needed by a player to ...
Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Pr...
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 6 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
DIAGRAMS
2008
Springer
13 years 10 months ago
Spider Diagrams of Order and a Hierarchy of Star-Free Regular Languages
Abstract. The spider diagram logic forms a fragment of constraint diagram logic and is designed to be primarily used as a diagrammatic software specification tool. Our interest is ...
Aidan Delaney, John Taylor, Simon J. Thompson
FSTTCS
2010
Springer
13 years 6 months ago
Parityizing Rabin and Streett
The parity acceptance condition for -regular languages is a special case of the Rabin and Streett acceptance conditions. While the parity acceptance condition is as expressive as ...
Udi Boker, Orna Kupferman, Avital Steinitz