Titlebook: Language and Automata Theory and Applications; 10th International C Adrian-Horia Dediu,Jan Janoušek,Bianca Truthe Conference proceedings 20

artless

含铁

类型

高调

LUDE

A Logical Characterization for Dense-Time Visibly Pushdown Automatall as resets visible. We present MSO logic characterization of these automata and prove the decidability of the emptiness problem for these automata paving way for verification problem for dense-timed pushdown automata against dense-timed visibly pushdown automata specification.

血统

允许

myelography

Reasoning with Prototypes in the Description Logic , Using Weighted Tree Automatarity tree automata (wapta) over the non-negative integers can be used to define pdfs, and how this allows us to use both concepts and pointed interpretations as prototypes. Finally, we investigate the complexity of reasoning in ., which extends the Description Logic . with the constructors . for pdfs defined using wapta.

Spinal-Tap

Evacuate

A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theoremrage. In particular, this implies a Büchi-Elgot-Trakhtenbrot Theorem for weighted iterated pushdown languages. For this choice of storage type, the satisfiability problem of the logic is decidable for each bounded lattice provided that its infimum is computable.