H. Schmitz. Generalized Deterministic Languages and their Automata: A Characterization of Restricted Temporal Logic. April 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Languages of Dot-Depth 3/2 - Glaßer, Schmitz (2000) (1 citation) Self-citation (Schmitz) (Correct)
.... testable events (see [BS73, McN74] when relating the dot depth hierarchy and the Straubing Therien hierarchy (as mentioned above, see [Str85] for a levelwise analysis of dot depth one languages (see [Ste85a] also [Sch99b] when studying the notion of generalized deterministic languages (see [Sch99a]) and it was mentioned recently in [TW98] 3 We first look at the family of classes B 3=2;k . With help of a number of closure properties and a series of technical lemmas we prove a useful normalform representation for languages in B 3=2;k . This normalform was known before for the case k = 0 ....
....we require here n 1 which is no restriction since ( Sigma 0 ) k contains only words of length k 1 and hence ( Sigma 0 ) k = S fi2 Sigma 0 ( Sigma 0 ; fi; Sigma 0 ) k . Furthermore, deterministic versions of these languages with requirements of the type ff i 62 Sigma i were studied in [Sch99a]. These generalized deterministic languages were shown to be equal to languages definable by formulas of restricted temporal logic, which in turn are known to correspond to languages having locally R trivial syntactic semigroups and to languages having locally L trivial syntactic semigroups (cf. ....
H. Schmitz. Generalized deterministic languages and their automata: A characterization of restricted temporal logic. Technical Report 226, Inst. fur Informatik, Univ. Wurzburg, 1999. An extended abstract appeared in the Preproceedings of DCAGRS'99, Magdeburg.
Boolean Hierarchies inside Dot-Depth One - Schmitz (1999) (2 citations) Self-citation (Schmitz) (Correct)
....k (L) 9 Summary We summarize the results of the structure of B 1 in Figure 7. Recall that in case k = 0 we deal with the usual concatenation and hence we encounter the Boolean hierarchy over level 1=2 of the Straubing Therien hierarchy. Generalizations of languages in B 1;k were studied in [Sch99a] 24 Acknowledgements. Thanks are due to Christian Glaer for his comments and for reading proofs, and to Klaus W. Wagner, because parts of this paper are generalizations of methods developed in [SW98] for the case k = 0. ....
H. Schmitz. Generalized deterministic languages and their automata: A characterization of restricted temporal logic. Technical Report 226, Inst. fur Informatik, Univ. Wurzburg, 1999. An extended abstract appeared in the Preproceedings of DCAGRS'99, Magdeburg.
Equivalence Problems for Boolean Constraint Satisfaction - Böhler, Hemaspaandra.. (2001) (Correct)
No context found.
H. Schmitz. Generalized Deterministic Languages and their Automata: A Characterization of Restricted Temporal Logic. April 1999.
Lecture Notes for Logic and Interaction - Böhler, Vollmer (2002) (Correct)
No context found.
H. Schmitz. Generalized Deterministic Languages and their Automata: A Characterization of Restricted Temporal Logic. April 1999.
Practical Strategies for Hypotheses Elimination on the.. - Buck, Schäfer.. (1999) (2 citations) (Correct)
No context found.
H. Schmitz. Generalized Deterministic Languages and their Automata: A Characterization of Restricted Temporal Logic. April 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC