| Nome |
# |
|
Maximal decidable fragments of Halpern and Shoham's modal logic of intervals, file e27ce0c1-d817-055e-e053-6605fe0a7873
|
140
|
|
On the relationships between theories of time granularity and the monadic second-order theory of one successor, file e27ce0c1-cc9e-055e-e053-6605fe0a7873
|
136
|
|
Games, Automata, Logic, and Formal Verification (GandALF 2013) - Special Issue of the journal Information and Computation, Editorial pp. 1-2, file e27ce0c2-64e7-055e-e053-6605fe0a7873
|
82
|
|
Ciaramella: A Synchronous Data Flow Programming Language For Audio DSP, file 1988e1a9-f076-4691-b9ad-89f690c6b819
|
49
|
|
An Algebraic Approach to Mso-Definability on Countable Linear Orderings, file e27ce0c9-70dd-055e-e053-6605fe0a7873
|
48
|
|
Bounded repairability for regular tree languages, file e27ce0c9-5b35-055e-e053-6605fe0a7873
|
41
|
|
Logics with rigidly guarded data tests, file e27ce0c9-6f2f-055e-e053-6605fe0a7873
|
30
|
|
Decidability of the interval temporal logic ABB* over the natural numbers, file e27ce0c1-ee7b-055e-e053-6605fe0a7873
|
17
|
|
Querying Visible and Invisible Information, file e27ce0c9-7071-055e-e053-6605fe0a7873
|
17
|
|
One-way definability of sweeping transducers, file e27ce0c7-994d-055e-e053-6605fe0a7873
|
15
|
|
One-way resynchronizability of word transducers, file e27ce0c9-6dc5-055e-e053-6605fe0a7873
|
15
|
|
The many facets of string transducers, file e27ce0c7-9a36-055e-e053-6605fe0a7873
|
14
|
|
On the decomposition of finite-valued streaming string transducers, file e27ce0c7-6130-055e-e053-6605fe0a7873
|
13
|
|
On synthesis of resynchronizers for transducers, file e27ce0c7-9cb9-055e-e053-6605fe0a7873
|
13
|
|
Origin-equivalence of two-way word transducers is in PSPACE, file e27ce0c7-73af-055e-e053-6605fe0a7873
|
12
|
|
Untwisting two-way transducers in elementary time, file e27ce0c9-5b3b-055e-e053-6605fe0a7873
|
12
|
|
One-way definability of two-way word transducers, file e27ce0c9-7305-055e-e053-6605fe0a7873
|
11
|
|
Resynchronizing classes of word relations, file e27ce0c9-6eb3-055e-e053-6605fe0a7873
|
10
|
|
Dynamic Data Structures for Timed Automata Acceptance, file d3cf44e1-a0fd-40c7-8f94-e27a44d390ac
|
6
|
|
A decidable weakening of compass logic based on cone-shaped cardinal directions, file e27ce0c8-a32c-055e-e053-6605fe0a7873
|
6
|
|
Resynchronizing classes of word relations, file e27ce0c9-6eb4-055e-e053-6605fe0a7873
|
6
|
|
One-way definability of two-way word transducers, file e27ce0c9-7306-055e-e053-6605fe0a7873
|
6
|
|
An Algebraic Approach to Mso-Definability on Countable Linear Orderings, file e27ce0c9-829e-055e-e053-6605fe0a7873
|
6
|
|
Walking on data words, file e27ce0c7-5f8f-055e-e053-6605fe0a7873
|
4
|
|
Towards Compact and Tractable Automaton-Based Representations of Time Granularities, file e27ce0c7-5f7d-055e-e053-6605fe0a7873
|
3
|
|
Logics with rigidly guarded data tests, file e27ce0c9-9941-055e-e053-6605fe0a7873
|
3
|
|
Automata for branching and layered temporal structures: An investigation into regularities of infinite transition systems, file e27ce0c7-97a4-055e-e053-6605fe0a7873
|
2
|
|
The cost of traveling between languages, file e27ce0c7-9887-055e-e053-6605fe0a7873
|
2
|
|
Bounded repairability for regular tree languages, file e27ce0c7-9942-055e-e053-6605fe0a7873
|
2
|
|
The per-character cost of repairing word languages, file e27ce0c7-994b-055e-e053-6605fe0a7873
|
2
|
|
Walking on Data Words, file e27ce0c7-9a32-055e-e053-6605fe0a7873
|
2
|
|
Equivalence of finite-valued streaming string transducers is decidable, file e27ce0c9-adbb-055e-e053-6605fe0a7873
|
2
|
|
Inference from Visible Information and Background Knowledge, file e27ce0ca-1987-055e-e053-6605fe0a7873
|
2
|
|
A Theory of Ultimately Periodic Languages and Automata with an Application to Time Granularity, file e27ce0c1-cddc-055e-e053-6605fe0a7873
|
1
|
|
A Contraction Method to Decide MSO Theory of Deterministic Trees, file e27ce0c1-d7df-055e-e053-6605fe0a7873
|
1
|
|
Decidability of the interval temporal logic AA*BB* over the rationals, file e27ce0c1-f79c-055e-e053-6605fe0a7873
|
1
|
|
Positive higher-order queries, file e27ce0c7-6128-055e-e053-6605fe0a7873
|
1
|
|
Regular repair of specifications, file e27ce0c7-612b-055e-e053-6605fe0a7873
|
1
|
|
Time Granularities and Ultimately Periodic Automata, file e27ce0c7-6c6c-055e-e053-6605fe0a7873
|
1
|
|
Decidability of the theory of the totally unbounded ω-layered structure, file e27ce0c7-72cc-055e-e053-6605fe0a7873
|
1
|
|
A decidable weakening of compass logic based on cone-shaped cardinal directions, file e27ce0c7-73ad-055e-e053-6605fe0a7873
|
1
|
|
Decidability of MSO Theories of Tree Structures, file e27ce0c7-73ba-055e-e053-6605fe0a7873
|
1
|
|
Regular languages of words over countable linear orderings, file e27ce0c7-97a0-055e-e053-6605fe0a7873
|
1
|
|
On the use of guards for logics with data, file e27ce0c7-97a2-055e-e053-6605fe0a7873
|
1
|
|
Automata vs. logics on data words, file e27ce0c7-97a8-055e-e053-6605fe0a7873
|
1
|
|
Which DTDs are streaming bounded repairable?, file e27ce0c7-988e-055e-e053-6605fe0a7873
|
1
|
|
Bounded repairability of word languages, file e27ce0c7-9890-055e-e053-6605fe0a7873
|
1
|
|
What you must remember when processing data words, file e27ce0c7-993f-055e-e053-6605fe0a7873
|
1
|
|
The complexity of higher-order queries, file e27ce0c7-994f-055e-e053-6605fe0a7873
|
1
|
|
Which XML Schemas are Streaming Bounded Repairable?, file e27ce0c7-acbb-055e-e053-6605fe0a7873
|
1
|
|
Equivalence of finite-valued streaming string transducers is decidable, file e27ce0c9-9943-055e-e053-6605fe0a7873
|
1
|
|
Bounded repairability for regular tree languages, file e27ce0c9-9e23-055e-e053-6605fe0a7873
|
1
|
| Totale |
748 |