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
Works matching IS 18605974 AND DT 2013 AND VI 9 AND IP 2
Results: 2
1
2
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