Results 41 to 50 of about 46,330 (328)
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
Decidability of multiset, set and numerically decipherable directed figure codes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Codes with various kinds of decipherability, weaker than the usual unique decipherability, have been studied since multiset decipherability was introduced in mid-1980s.
Włodzimierz Moczurad
doaj +1 more source
Supervisory Control of (max,+) Automata: A Behavioral Approach [PDF]
, 2009 A behavioral framework for control of (max,+) automata is proposed. It is based on behaviors (formal power series) and a generalized version of the Hadamard product, which is the behavior of a generalized tensor product of the plant and controller (max,+)
J. Komenda, J.L. Boimond, S. Lahaye
core +2 more sources
Most Complex Regular Ideal Languages [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 A right ideal (left ideal, two-sided ideal) is a non-empty language $L$ over an alphabet $\Sigma$ such that $L=L\Sigma^*$ ($L=\Sigma^*L$, $L=\Sigma^*L\Sigma^*$). Let $k=3$ for right ideals, 4 for left ideals and 5 for two-sided ideals. We show that there
Janusz Brzozowski +2 more
doaj +1 more source
Distributed Graph Automata and Verification of Distributed Algorithms [PDF]
, 2014 Combining ideas from distributed algorithms and alternating automata, we introduce a new class of finite graph automata that recognize precisely the languages of finite graphs definable in monadic second-order logic.
Reiter, Fabian
core +1 more source
Edit Distance for Pushdown Automata [PDF]
Logical Methods in Computer Science, 2017 The edit distance between two words $w_1, w_2$ is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform $w_1$ to $w_2$.
Krishnendu Chatterjee +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
Computer Aided Verification32nd International Conference, 2020 Computer science class enrollments have rapidly risen in the past decade. With current class sizes, standard approaches to grading and providing personalized feedback are no longer possible and new techniques become both feasible and necessary.
D’Antoni L +4 more
europepmc +2 more sources
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