scientific article; zbMATH DE number 5279356
From MaRDI portal
Publication:5387658
zbMath1152.68462MaRDI QIDQ5387658
Kumar Neeraj Verma, Jean Goubault-Larrecq
Publication date: 27 May 2008
Full work available at URL: https://eudml.org/doc/129486
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Related Items (12)
Alternating two-way AC-tree automata ⋮ Nonelementary Complexities for Branching VASS, MELL, and Extensions ⋮ The reachability problem for branching vector addition systems requires doubly-exponential space ⋮ Commutative Lambek grammars ⋮ Logics of Repeating Values on Data Trees and Branching Counter Systems ⋮ Strategic reasoning with a bounded number of resources: the quest for tractability ⋮ Decidable models of integer-manipulating programs with recursive parallelism ⋮ On the complexity of resource-bounded logics ⋮ The ideal view on Rackoff's coverability technique ⋮ Unnamed Item ⋮ Forward analysis for WSTS, part I: completions ⋮ Unnamed Item
This page was built for publication:
