Sciweavers

39 search results - page 1 / 8
» Equivalent Conditions for Regularity (Extended Abstract)
Sort
View
LATIN
2000
Springer
13 years 8 months ago
Equivalent Conditions for Regularity (Extended Abstract)
d abstract) Book section (Refereed) Original citation: Originally published in Gonnet, G; Panario D; Viola, A, LATIN 2000: theoretical informatics. Lecture notes in computer scienc...
Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Sko...
SOFSEM
1997
Springer
13 years 8 months ago
On Finite Representations of Infinite-State Behaviours
Abstract. We examine the problem of finite-state representability of infinitestate processes w.r.t. certain behavioural equivalences. We show that the classical notion of regularit...
Antonín Kucera
ICDT
2005
ACM
102views Database» more  ICDT 2005»
13 years 10 months ago
Selecting and Using Views to Compute Aggregate Queries (Extended Abstract)
d abstract) Foto Afrati1 and Rada Chirkova2 1 Electrical and Computing Eng., National Technical University of Athens, 157 73 Athens, Greece 2 Computer Science Department, North Car...
Foto N. Afrati, Rada Chirkova
ICALP
2000
Springer
13 years 9 months ago
Reasoning about Idealized ALGOL Using Regular Languages
We explain how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized Algol (IA) by expressing sets of ...
Dan R. Ghica, Guy McCusker
MFCS
2004
Springer
13 years 10 months ago
Complexity of Decision Problems for Simple Regular Expressions
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
Wim Martens, Frank Neven, Thomas Schwentick