Works matching IS 18605974 AND DT 2013 AND VI 9 AND IP 3
Results: 29
ALTERNATING TURING MACHINES FOR INDUCTIVE LANGUAGES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:29)2013
- By:
- Publication type:
- Article
MODELLING PROBABILISTIC WIRELESS NETWORKS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:26)2013
- By:
- Publication type:
- Article
ON CHARACTERISING DISTRIBUTABILITY.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:17)2013
- By:
- Publication type:
- Article
EXPLORING THE BOUNDARIES OF MONAD TENSORABILITY ON SET.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:22)2013
- By:
- Publication type:
- Article
UNARY NEGATION.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:25)2013
- By:
- Publication type:
- Article
BASES AS COALGEBRAS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:23)2013
- By:
- Publication type:
- Article
A POLYNOMIAL TRANSLATION OF π-CALCULUS FCPS TO SAFE PETRI NETS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:18)2013
- By:
- Publication type:
- Article
REACHABILITY PROBLEM FOR WEAK MULTI-PUSHDOWN AUTOMATA.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:13)2013
- By:
- Publication type:
- Article
INDUCTION IN ALGEBRA: A FIRST CASE STUDY.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:20)2013
- By:
- Publication type:
- Article
LINEARIZABILITY WITH OWNERSHIP TRANSFER.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:12)2013
- By:
- Publication type:
- Article
REACHABILITY UNDER CONTEXTUAL LOCKING.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:21)2013
- By:
- Publication type:
- Article
UNIVERSAL CODES OF THE NATURAL NUMBERS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:7)2013
- By:
- Publication type:
- Article
COALGEBRAIC CHARACTERIZATIONS OF CONTEXT-FREE LANGUAGES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:14)2013
- By:
- Publication type:
- Article
MEASURE TRANSFORMER SEMANTICS FOR BAYESIAN MACHINE LEARNING.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:11)2013
- By:
- Publication type:
- Article
ALGEBRAIC STRUCTURE OF COMBINED TRACES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:8)2013
- By:
- Publication type:
- Article
COMPUTABILITY OF PROBABILITY DISTRIBUTIONS AND CHARACTERISTIC FUNCTIONS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:9)2013
- By:
- Publication type:
- Article
CARTESIAN CLOSED 2-CATEGORIES AND PERMUTATION EQUIVALENCE IN HIGHER-ORDER REWRITING.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:10)2013
- By:
- Publication type:
- Article
PEBBLE GAMES, PROOF COMPLEXITY, AND TIME-SPACE TRADE-OFFS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:15)2013
- By:
- Publication type:
- Article
INDEXED INDUCTION AND COINDUCTION, FIBRATIONALLY.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:6)2013
- By:
- Publication type:
- Article
ABSTRACT GSOS RULES AND A MODULAR TREATMENT OF RECURSIVE DEFINITIONS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:28)2013
- By:
- Publication type:
- Article
CONNECTOR ALGEBRAS FOR C/E AND P/T NETS' INTERACTIONS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:16)2013
- By:
- Publication type:
- Article
COMPUTABLY REGULAR TOPOLOGICAL SPACES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:5)2013
- By:
- Publication type:
- Article
AUTOMATIC FUNCTIONS, LINEAR TIME AND LEARNING.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:19)2013
- By:
- Publication type:
- Article
MODAL INTERFACE AUTOMATA.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:4)2013
- By:
- Publication type:
- Article
WELL-POINTED COALGEBRAS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:2)2013
- By:
- Publication type:
- Article
A STATIC ANALYSIS FRAMEWORK FOR LIVELOCK FREEDOM IN CSP.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/lmcs-9(3:24)2013
- By:
- Publication type:
- Article
GRAPH LOGICS WITH RATIONAL RELATIONS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/lmcs-9(3:1)2013
- By:
- Publication type:
- Article
REGULAR COST FUNCTIONS, PART I: LOGIC AND ALGEBRA OVER WORDS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:3)2013
- By:
- Publication type:
- Article
RANDOMNESS EXTRACTION AND ASYMPTOTIC HAMMING DISTANCE.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:27)2013
- By:
- Publication type:
- Article