Found: 8
Select item for more details and to access through your institution.
Rigidity is undecidable.
- Published in:
- Mathematical Structures in Computer Science, 2014, v. 24, n. 6, p. 00, doi. 10.1017/S096012951300087X
- By:
- Publication type:
- Article
Regular Languages of Thin Trees.
- Published in:
- Theory of Computing Systems, 2016, v. 58, n. 4, p. 614, doi. 10.1007/s00224-014-9595-z
- By:
- Publication type:
- Article
Nominal Monoids.
- Published in:
- Theory of Computing Systems, 2013, v. 53, n. 2, p. 194, doi. 10.1007/s00224-013-9464-1
- By:
- Publication type:
- Article
Foreword.
- Published in:
- 2011
- By:
- Publication type:
- Editorial
Weak MSO with the Unbounding Quantifier.
- Published in:
- Theory of Computing Systems, 2011, v. 48, n. 3, p. 554, doi. 10.1007/s00224-010-9279-2
- By:
- Publication type:
- Article
Ramsey's theorem for colors from a metric space.
- Published in:
- Semigroup Forum, 2012, v. 85, n. 1, p. 182, doi. 10.1007/s00233-012-9404-4
- By:
- Publication type:
- Article
DEFINABLE DECOMPOSITIONS FOR GRAPHS OF BOUNDED LINEAR CLIQUEWIDTH.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 1, p. 1, doi. 10.23638/LMCS-17(15)2021
- By:
- Publication type:
- Article
AUTOMATA THEORY IN NOMINAL SETS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:4)2014
- By:
- Publication type:
- Article