Results 31 to 40 of about 45,230 (224)
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
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
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
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
Satisfiability Games for Branching-Time Logics [PDF]
, 2013 The satisfiability problem for branching-time temporal logics like CTL*, CTL and CTL+ has important applications in program specification and verification. Their computational complexities are known: CTL* and CTL+ are complete for doubly exponential time,
Friedmann, Oliver +2 more
core +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
Regular Languages in the Sliding Window Model [PDF]
TheoretiCSWe study the space complexity of the following problem: For a fixed regular language $L$, we receive a stream of symbols and want to test membership of a sliding window of size $n$ in $L$.
Moses Ganardi +4 more
doaj +1 more source
Completing the picture for the Skolem Problem on order-4 linear recurrence sequences [PDF]
TheoretiCSFor 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
Quantitative Automata under Probabilistic Semantics [PDF]
Logical Methods in Computer Science, 2019 Automata with monitor counters, where the transitions do not depend on counter values, and nested weighted automata are two expressive automata-theoretic frameworks for quantitative properties. For a well-studied and wide class of quantitative functions,
Krishnendu Chatterjee +2 more
doaj +1 more source