Results 51 to 60 of about 43,821 (313)
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
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
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
Computing the Width of Non-deterministic Automata [PDF]
Logical Methods in Computer Science, 2019 We introduce a measure called width, quantifying the amount of nondeterminism in automata. Width generalises the notion of good-for-games (GFG) automata, that correspond to NFAs of width 1, and where an accepting run can be built on-the-fly on any ...
Denis Kuperberg, Anirban Majumdar
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
Characterizations of recognizable picture series [PDF]
, 1935 The theory of two-dimensional languages as a generalization of formal string languages was motivated by problems arising from image processing and pattern recognition, and also concerns models of parallel computing.
Mäurer, Ina
core +1 more source
FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems [PDF]
Logical Methods in Computer Science, 2016 A data tree is an unranked ordered tree where each node carries a label from a finite alphabet and a datum from some infinite domain. We consider the two variable first order logic FO2(
Florent Jacquemard +2 more
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
Complexity of Problems of Commutative Grammars [PDF]
Logical Methods in Computer Science, 2015 We consider commutative regular and context-free grammars, or, in other words, Parikh images of regular and context-free languages. By using linear algebra and a branching analog of the classic Euler theorem, we show that, under an assumption that the ...
Eryk Kopczynski
doaj +1 more source