Sciweavers

759 search results - page 72 / 152
» Odometers on Regular Languages
Sort
View
CONCUR
2007
Springer
15 years 4 months ago
Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness
Abstract. We consider linear time temporal logic enriched with semiextended regular expressions through various operators that have been proposed in the literature, in particular i...
Martin Lange
APLAS
2006
ACM
15 years 3 months ago
XML Validation for Context-Free Grammars
String expression analysis conservatively approximates the possible string values generated by a program. We consider the validation of a context-free grammar obtained by the analy...
Yasuhiko Minamide, Akihiko Tozawa
MFCS
2005
Springer
15 years 3 months ago
Inverse Monoids: Decidability and Complexity of Algebraic Questions
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
Markus Lohrey, Nicole Ondrusch
CAV
2004
Springer
87views Hardware» more  CAV 2004»
15 years 3 months ago
GSTE Is Partitioned Model Checking
Verifying whether an ω-regular property is satisfied by a finite-state system is a core problem in model checking. Standard techniques build an automaton with the complementary ...
Roberto Sebastiani, Eli Singerman, Stefano Tonetta...
AML
2000
71views more  AML 2000»
14 years 9 months ago
Consistency of V = HOD with the wholeness axiom
The Wholeness Axiom (WA) is an axiom schema that can be added to the axioms of ZFC in an extended language {, j}, and that asserts the existence of a nontrivial elementary embeddin...
Paul Corazza