Results 21 to 30 of about 2,186 (279)

Algebraic Language Theory for Eilenberg--Moore Algebras [PDF]

Logical Methods in Computer Science, 2021
We develop an algebraic language theory based on the notion of an Eilenberg--Moore algebra. In comparison to previous such frameworks the main contribution is the support for algebras with infinitely many sorts and the connection to logic in form of so ...
Achim Blumensath
doaj   +1 more source

The Expansion Problem for Infinite Trees [PDF]

Logical Methods in Computer Science
We study Ramsey like theorems for infinite trees and similar combinatorial tools. As an application we consider the expansion problem for tree algebras.
Achim Blumensath
doaj   +1 more source

On Separation by Locally Testable and Locally Threshold Testable Languages [PDF]

Logical Methods in Computer Science, 2014
A separator for two languages is a third language containing the first one and disjoint from the second one. We investigate the following decision problem: given two regular input languages, decide whether there exists a locally testable (resp. a locally
Thomas Place, Lorijn van Rooijen, Marc Zeitoun   +2 more
doaj   +1 more source

Parametric updates in parametric timed automata [PDF]

Logical Methods in Computer Science, 2021
We introduce a new class of Parametric Timed Automata (PTAs) where we allow clocks to be compared to parameters in guards, as in classic PTAs, but also to be updated to parameters.
Étienne André, Didier Lime, Mathias Ramparison   +2 more
doaj   +1 more source

Extended Stone Duality via Monoidal Adjunctions [PDF]

Logical Methods in Computer Science
Extensions of Stone-type dualities have a long history in algebraic logic and have also been instrumental in proving results in algebraic language theory.
Fabian Lenke, Henning Urbat, Stefan Milius   +2 more
doaj   +1 more source

A bialgebraic approach to automata and formal language theory [PDF]

Annals of Pure and Applied Logic, 2008
29 pages, fixed typos, added ...
openaire   +3 more sources

Completing the picture for the Skolem Problem on order-4 linear recurrence sequences [PDF]

TheoretiCS
For almost a century, the decidability of the Skolem Problem - that is, the problem of finding whether a given linear recurrence sequence (LRS) has a zero term - has remained open. A breakthrough in the 1980s established that the Skolem Problem is indeed
Piotr Bacik
doaj   +1 more source

Separation Property for wB- and wS-regular Languages [PDF]

Logical Methods in Computer Science, 2014
In this paper we show that {\omega}B- and {\omega}S-regular languages satisfy the following separation-type theorem If L1,L2 are disjoint languages of {\omega}-words both recognised by {\omega}B- (resp.
Michał Skrzypczak
doaj   +1 more source

Watson-Crick conjugates of words and languages [PDF]

Discrete Mathematics & Theoretical Computer Science
In this work, we explore the concept of Watson-Crick conjugates, also known as $θ$-conjugates (where $θ$ is an antimorphic involution), of words and languages.
Kalpana Mahalingam, Anuran Maity
doaj   +1 more source

Avoiding Shared Clocks in Networks of Timed Automata [PDF]

Logical Methods in Computer Science, 2013
Networks of timed automata (NTA) are widely used to model distributed real-time systems. Quite often in the literature, the automata are allowed to share clocks, i.e.
Sandie Balaguer, Thomas Chatain
doaj   +1 more source