Sciweavers

7 search results - page 1 / 2
» A Correspondence between Balanced Varieties and Inverse Mono...
Sort
View
IJAC
2006
118views more  IJAC 2006»
13 years 4 months ago
A Correspondence between Balanced Varieties and Inverse Monoids
There is a well-known correspondence between varieties of algebras and fully invariant congruences on the appropriate term algebra. A special class of varieties are those which ar...
Mark V. Lawson
TCS
2008
13 years 4 months ago
On varieties of meet automata
Eilenberg's variety theorem gives a bijective correspondence between varieties of languages and varieties of finite monoids. The second author gave a similar relation between...
Ondrej Klíma, Libor Polák
ESA
2010
Springer
133views Algorithms» more  ESA 2010»
13 years 5 months ago
Balancing Degree, Diameter and Weight in Euclidean Spanners
Abstract. In a seminal STOC'95 paper, Arya et al. [4] devised a construction that for any set S of n points in Rd and any > 0, provides a (1 + )-spanner with diameter O(lo...
Shay Solomon, Michael Elkin
FUIN
2007
135views more  FUIN 2007»
13 years 4 months ago
On First-Order Fragments for Mazurkiewicz Traces
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
Volker Diekert, Martin Horsch, Manfred Kufleitner
DLT
2010
13 years 6 months ago
Around Dot Depth Two
It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...
Kamal Lodaya, Paritosh K. Pandya, Simoni S. Shah