Searching for authors named "Manfred Kufleitner" – sorted by Relevance.
5 documents found, showing 1 through 5.
-
A Proof of the Factorization Forest Theorem
- …We show that for every homomorphism Γ + → S where S is a finite semigroup there exists a factorization forest of height ≤ 3 |S|. The proof is based on Green’s relations. 1…
- Cited by 1 (1 self) – Add To MetaCart
-
On first-order fragments for words and Mazurkiewicz traces: A survey
- …Abstract. We summarize several characterizations, inclusions, and separations on fragments of first-order logic over words and Mazurkiewicz traces. The results concerning Mazurkiewicz traces can be seen as generalizations of those for words. It turns out that over traces it is crucial, how easy conc…
- Cited by 1 (1 self) – Add To MetaCart
-
Symposium on Theoretical Aspects of Computer Science year (city), pp. numbers www.stacs-conf.org FRAGMENTS OF FIRST-ORDER LOGIC OVER INFINITE WORDS (EXTENDED ABSTRACT)
- …Abstract. We give topological and algebraic characterizations as well as language theoretic descriptions of the following subclasses of first-order logic FO[<] for ω-languages: Σ2, ∆2, FO 2 ∩ Σ2 (and by duality FO 2 ∩ Π2), and FO 2. These descriptions extend the respective results for finite words. …
- Add To MetaCart
-
On first-order fragments for Mazurkiewicz traces
- …Abstract Mazurkiewicz traces form a model for concurrency. Temporal logic and first-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical properties can be described by rather simple logical formulas one is interested in logical fragments. One foc…
- Cited by 1 (1 self) – Add To MetaCart
-
A survey on small fragments of first-order logic over finite words
- …1…
- Cited by 1 (1 self) – Add To MetaCart
Showing 1 through 5.
