Decidable First-Order Theories of One-Step Rewriting in Trace Monoids.
- Published in:
- Theory of Computing Systems, 2005, v. 38, n. 1, p. 39, doi. 10.1007/s00224-004-1099-9
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2005 AND VI 38 AND IP 1
Results: 4
1
2
A Kleene Theorem for Weighted Tree Automata.
- Published in:
- Theory of Computing Systems, 2005, v. 38, n. 1, p. 1, doi. 10.1007/s00224-004-1096-z
- By:
- Publication type:
- Article
3
NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems.
- Published in:
- Theory of Computing Systems, 2005, v. 38, n. 1, p. 83, doi. 10.1007/s00224-004-1114-1
- By:
- Publication type:
- Article
4
A Simple Optimal Solution for the Temporal Precedence Problem on Pure Pointer Machines.
- Published in:
- Theory of Computing Systems, 2005, v. 38, n. 1, p. 115, doi. 10.1007/s00224-004-1118-x
- By:
- Publication type:
- Article