443 research outputs found

    Ambiguity, Weakness, and Regularity in Probabilistic B\"uchi Automata

    Full text link
    Probabilistic B\"uchi automata are a natural generalization of PFA to infinite words, but have been studied in-depth only rather recently and many interesting questions are still open. PBA are known to accept, in general, a class of languages that goes beyond the regular languages. In this work we extend the known classes of restricted PBA which are still regular, strongly relying on notions concerning ambiguity in classical omega-automata. Furthermore, we investigate the expressivity of the not yet considered but natural class of weak PBA, and we also show that the regularity problem for weak PBA is undecidable

    26. Theorietag Automaten und Formale Sprachen 23. Jahrestagung Logik in der Informatik: Tagungsband

    Get PDF
    Der Theorietag ist die Jahrestagung der Fachgruppe Automaten und Formale Sprachen der Gesellschaft für Informatik und fand erstmals 1991 in Magdeburg statt. Seit dem Jahr 1996 wird der Theorietag von einem eintägigen Workshop mit eingeladenen Vorträgen begleitet. Die Jahrestagung der Fachgruppe Logik in der Informatik der Gesellschaft für Informatik fand erstmals 1993 in Leipzig statt. Im Laufe beider Jahrestagungen finden auch die jährliche Fachgruppensitzungen statt. In diesem Jahr wird der Theorietag der Fachgruppe Automaten und Formale Sprachen erstmalig zusammen mit der Jahrestagung der Fachgruppe Logik in der Informatik abgehalten. Organisiert wurde die gemeinsame Veranstaltung von der Arbeitsgruppe Zuverlässige Systeme des Instituts für Informatik an der Christian-Albrechts-Universität Kiel vom 4. bis 7. Oktober im Tagungshotel Tannenfelde bei Neumünster. Während des Tre↵ens wird ein Workshop für alle Interessierten statt finden. In Tannenfelde werden • Christoph Löding (Aachen) • Tomás Masopust (Dresden) • Henning Schnoor (Kiel) • Nicole Schweikardt (Berlin) • Georg Zetzsche (Paris) eingeladene Vorträge zu ihrer aktuellen Arbeit halten. Darüber hinaus werden 26 Vorträge von Teilnehmern und Teilnehmerinnen gehalten, 17 auf dem Theorietag Automaten und formale Sprachen und neun auf der Jahrestagung Logik in der Informatik. Der vorliegende Band enthält Kurzfassungen aller Beiträge. Wir danken der Gesellschaft für Informatik, der Christian-Albrechts-Universität zu Kiel und dem Tagungshotel Tannenfelde für die Unterstützung dieses Theorietags. Ein besonderer Dank geht an das Organisationsteam: Maike Bradler, Philipp Sieweck, Joel Day. Kiel, Oktober 2016 Florin Manea, Dirk Nowotka und Thomas Wilk

    Grammatical sets in half-ring morphologies /

    Get PDF

    Logic and Automata

    Get PDF
    Mathematical logic and automata theory are two scientific disciplines with a fundamentally close relationship. The authors of Logic and Automata take the occasion of the sixtieth birthday of Wolfgang Thomas to present a tour d'horizon of automata theory and logic. The twenty papers in this volume cover many different facets of logic and automata theory, emphasizing the connections to other disciplines such as games, algorithms, and semigroup theory, as well as discussing current challenges in the field

    Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS'09)

    Get PDF
    The Symposium on Theoretical Aspects of Computer Science (STACS) is held alternately in France and in Germany. The conference of February 26-28, 2009, held in Freiburg, is the 26th in this series. Previous meetings took place in Paris (1984), Saarbr¨ucken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992), W¨urzburg (1993), Caen (1994), M¨unchen (1995), Grenoble (1996), L¨ubeck (1997), Paris (1998), Trier (1999), Lille (2000), Dresden (2001), Antibes (2002), Berlin (2003), Montpellier (2004), Stuttgart (2005), Marseille (2006), Aachen (2007), and Bordeaux (2008). ..

    Paths in first language acquisition: Motion through space in English, French and Japanese

    Get PDF
    This thesis examines how children attain the linguistic knowledge they need to grammatically express basic trajectories through physical space in English, French and Japanese. In Talmy's (1991; 2000b) descriptive binary typology, 'verb-framed’ languages such as Japanese and French systematically encode PATH (or 'direction') in verbs, whilst 'satellite-framed' languages such as English systematically do so in adpositions. How such phenomena might be formalized is considered in terms of two contrasting hypotheses: (i) the Path Parameter Hypothesis, which suggests binary parameterization at the whole-language level, and (іі) the Lexicalist Path Hypothesis, which suggests that all relevant aspects of PATH predication are determined at the level of individual lexical items. Two experiments with original research methodology were conducted with English, French and Japanese children and adults. In Experiment I, directional predicates were elicited using a purpose-designed picture-story, and in Experiment II, grammaticality judgements were elicited from the same test subjects. Whilst predictions of general tendencies were upheld (strongly for English and Japanese, weakly for French), several findings support a non-parameterized, lexicalist account of PATH predication. First, in all child age groups, the three languages fell into discrete response categories for directional utterances in the absence of an inherent PATH verb. Second, both lexicalization types were found in each language, again in all age groups. Third, the three languages are revealed to have a shared syntax of directional predication, involving the same set of interpretable features and the same set of basic syntactic structures, including a layered pp structure. These findings suggest that whilst the typology remains broadly descriptive, there is no language-particular grammar involved in this variation. Rather, both directional V and a fully articulated pp structure are available in all three languages, show no discernable development, and are presumably part of the machinery of Universal Grammar. Children already understand the syntactic possibilities in the predication of PATH, but must learn the particular complexities of their lexicon, the primary locus of variation in the linguistic expression of motion events
    corecore