Results 31 to 40 of about 2,538 (309)
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
A bialgebraic approach to automata and formal language theory [PDF]
Annals of Pure and Applied Logic, 2008 29 pages, fixed typos, added ...
openaire +2 more sources
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
Robust Controller Synthesis in Timed Automata [PDF]
, 2013 We consider the fundamental problem of Büchi acceptance in timed automata in a robust setting. The problem is formalised in terms of controller synthesis: timed automata are equipped with a parametrised game-based semantics that models the possible ...
Reynier, Pierre-Alain +7 more
core +1 more source
Regular Languages: To Finite Automata and Beyond Succinct : Descriptions and Optimal Simulations [PDF]
, 2021 It is well known that the class of regular languages coincides with the class of languages recognized by finite automata. Nevertheless, many other characterizations of this class in terms of computational devices and generative models are present in the ...
Luca Prigioniero, Prigioniero, Luca
core +1 more source
Scope-bounded pushdown languages [PDF]
, 2014 We study the formal language theory of multistack push-down automata (Mpa) restricted to computations where a symbol can be popped from a stack S only if it was pushed within a bounded number of contexts of S (scoped Mpa).
Salvatore La Torre +5 more
core +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
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
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
A unifying approach for multistack pushdown automata [PDF]
, 2014 We give a general approach to show the closure under complement and decide the emptiness for many classes of multistack visibly pushdown automata (Mvpa). A central notion in our approach is the visibly path-tree, i.e., a stack tree with the encoding of a
Salvatore La Torre +5 more
core +1 more source