Results 21 to 30 of about 3,411 (291)
Connector algebras for C/E and P/T nets' interactions [PDF]
Logical Methods in Computer Science, 2013 A quite flourishing research thread in the recent literature on component-based systems is concerned with the algebraic properties of different classes of connectors.
Roberto Bruni +3 more
doaj +1 more source
Synthesis of Data Word Transducers [PDF]
Logical Methods in Computer Science, 2021 In reactive synthesis, the goal is to automatically generate an implementation from a specification of the reactive and non-terminating input/output behaviours of a system. Specifications are usually modelled as logical formulae or automata over infinite
Léo Exibard +2 more
doaj +1 more source
Minimality Notions via Factorization Systems and Examples [PDF]
Logical Methods in Computer Science, 2022 For the minimization of state-based systems (i.e. the reduction of the number of states while retaining the system's semantics), there are two obvious aspects: removing unnecessary states of the system and merging redundant states in the system.
Thorsten Wißmann
doaj +1 more source
Determinisability of register and timed automata [PDF]
Logical Methods in Computer Science, 2022 The deterministic membership problem for timed automata asks whether the timed language given by a nondeterministic timed automaton can be recognised by a deterministic timed automaton.
Lorenzo Clemente +2 more
doaj +1 more source
Asynchronous wreath product and cascade decompositions for concurrent behaviours [PDF]
Logical Methods in Computer Science, 2022 We develop new algebraic tools to reason about concurrent behaviours modelled as languages of Mazurkiewicz traces and asynchronous automata. These tools reflect the distributed nature of traces and the underlying causality and concurrency between events,
Bharat Adsul +3 more
doaj +1 more source
Minimisation of Multiplicity Tree Automata [PDF]
Logical Methods in Computer Science, 2017 We consider the problem of minimising the number of states in a multiplicity tree automaton over the field of rational numbers. We give a minimisation algorithm that runs in polynomial time assuming unit-cost arithmetic.
Stefan Kiefer +2 more
doaj +1 more source
Regular tree languages in low levels of the Wadge Hierarchy [PDF]
Logical Methods in Computer Science, 2019 In this article we provide effective characterisations of regular languages of infinite trees that belong to the low levels of the Wadge hierarchy. More precisely we prove decidability for each of the finite levels of the hierarchy; for the class of the ...
Mikołaj Bojańczyk +3 more
doaj +1 more source
On the expressiveness of spider diagrams and commutative star-free regular languages [PDF]
, 2013 Spider diagrams provide a visual logic to express relations between sets and their elements, extending the expressiveness of Venn diagrams. Sound and complete inference systems for spider diagrams have been developed and it is known that they are ...
Taylor, John +3 more
core +1 more source
A Robust Class of Context-Sensitive Languages
, 2007 We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolean operations.
MADHUSUDAN P +8 more
core +2 more sources
CPT443 – Automata Theory & Formal Languages (Teori Automata & Bahasa Formal) [PDF]
, 2021 Second Semester Examination 2020/2021 Academic Session July 2021 CPT443 – Automata Theory & Formal Languages (Teori Automata & Bahasa Formal) Duration : 2 hours (Masa : 2 ...
PPSKOM, Pusat Pengajian Sains Komputer
core +1 more source