Sciweavers

11 search results - page 1 / 3
» A Logical Approach to Decidability of Hierarchies of Regular...
Sort
View
STACS
2001
Springer
13 years 9 months ago
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
Victor L. Selivanov
DIAGRAMS
2008
Springer
13 years 6 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
ENTCS
2002
103views more  ENTCS 2002»
13 years 4 months ago
Deciding low levels of tree-automata hierarchy
The paper discusses the hierarchy of indices of finite automata over infinite objects. This hierarchy corresponds exactly to the hierarchy of alternations of least and greatest fi...
Igor Walukiewicz
ICALP
2000
Springer
13 years 8 months ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen
AAAI
2007
13 years 7 months ago
Answering Regular Path Queries in Expressive Description Logics: An Automata-Theoretic Approach
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to ...
Diego Calvanese, Thomas Eiter, Magdalena Ortiz