ADMISSIBILITY IN FINITELY GENERATED QUASIVARIETIES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 2, p. 1, doi. 10.2168/LMCS-9(2:09)2013
- By:
- Publication type:
- Article
Works matching IS 18605974 AND DT 2013 AND VI 9 AND IP 2
Results: 14
1
2
TREE-AUTOMATIC WELL-FOUNDED TREES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 2, p. 1, doi. 10.2168/LMCS-9(2:10)2013
- By:
- Publication type:
- Article
3
BISIMULATIONS MEET PCTL EQUIVALENCES FOR PROBABILISTIC AUTOMATA.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 2, p. 1, doi. 10.2168/LMCS-9(2:07)2013
- By:
- Publication type:
- Article
4
MARKOV TWO-COMPONENTS PROCESSES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 2, p. 1, doi. 10.2168/LMCS-9(2:14)2013
- By:
- Publication type:
- Article
5
PROPOSITIONAL DYNAMIC LOGIC WITH CONVERSE AND REPEAT FOR MESSAGE-PASSING SYSTEMS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 2, p. 1, doi. 10.2168/LMCS-9(2:12)2013
- By:
- Publication type:
- Article
6
UNIFYING THE LINEAR TIME-BRANCHING TIME SPECTRUM OF STRONG PROCESS SEMANTICS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 2, p. 1, doi. 10.2168/LMCS-9(2:11)2013
- By:
- Publication type:
- Article
7
TOTAL REPRESENTATIONS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 2, p. 1, doi. 10.2168/LMCS-9(2:05)2013
- By:
- Publication type:
- Article
8
EFFECTIVE CHARACTERIZATIONS OF SIMPLE FRAGMENTS OF TEMPORAL LOGIC USING CARTON–MICHEL AUTOMATA.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 2, p. 1, doi. 10.2168/LMCS-9(2:08)2013
- By:
- Publication type:
- Article
9
INFINITE SEQUENTIAL NASH EQUILIBRIUM.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 2, p. 1, doi. 10.2168/LMCS-9(2:3)2013
- By:
- Publication type:
- Article
10
TWO VARIABLE VS. LINEAR TEMPORAL LOGIC IN MODEL CHECKING AND GAMES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 2, p. 1, doi. 10.2168/LMCS-9(2:04)2013
- By:
- Publication type:
- Article
11
LOWER BOUND ON WEIGHTS OF LARGE DEGREE THRESHOLD FUNCTIONS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 2, p. 1, doi. 10.2168/LMCS-9(2:13)2013
- By:
- Publication type:
- Article
12
TIME AND PARALLELIZABILITY RESULTS FOR PARITY GAMES WITH BOUNDED TREE AND DAG WIDTH.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 2, p. 1, doi. 10.2168/LMCS-9(2:06)2013
- By:
- Publication type:
- Article
13
DECIDABLE CLASSES OF TREE AUTOMATA MIXING LOCAL AND GLOBAL CONSTRAINTS MODULO FLAT THEORIES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 2, p. 1, doi. 10.2168/lmcs-9(2:1)2013
- By:
- Publication type:
- Article
14
THE DEGREE STRUCTURE OF WEIHRAUCH REDUCIBILITY.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 2, p. 1, doi. 10.2168/lmcs-9(2:2)2013
- By:
- Publication type:
- Article