-
1
-
2by Adam Clarridge“...Cellular automata (CA) are an interesting computation medium to study because of their simplicity...”
Published 2009
Get access
Get access
Text -
3by Cervelle, Julien, Lafitte, GrégorySubjects: “...cellular automata...”
Published in 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (2017)
Get access
Get access
Conference Object -
4by Cervelle, Julien, Lafitte, GrégorySubjects: “...cellular automata...”
Published in 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (2017)
Get access
Get access
Conference Object -
5by Cervelle, Julien, Lafitte, GrégorySubjects: “...cellular automata...”
Published in 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (2017)
Get access
Get access
Conference Object -
6by Cervelle, Julien, Lafitte, GrégorySubjects: “...Automata...”
Published in 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (2017)
Get access
Get access
Conference Object -
7“...International audience The verification of probabilistic timed automata involves finding schedulers...”
Get access
Get access
Get access
Conference Object -
8“...International audience The verification of probabilistic timed automata involves finding schedulers...”
Get access
Get access
Get access
Conference Object -
9“...International audience The verification of probabilistic timed automata involves finding schedulers...”
Get access
Get access
Get access
Conference Object -
10“...International audience Parameterised Networks of Synchronised Automata (pNets) is a machine...”
Get access
Get access
Get access
Conference Object -
11“...International audience Parameterised Networks of Synchronised Automata (pNets) is a machine...”
Get access
Get access
Get access
Conference Object -
12
-
13“...International audience The verification of probabilistic timed automata involves finding schedulers...”
Get access
Get access
Get access
Conference Object -
14
-
15
-
16“...We use weighted tree automata as certificates for termination of term rewriting systems...”
Get access
Get access
Text -
17“...We use weighted tree automata as certificates for termination of term rewriting systems...”
Get access
Article in Journal/Newspaper -
18“...We use weighted tree automata as certificates for termination of term rewriting systems...”
Get access
Get access
Text -
19“...International audience Parameterised Networks of Synchronised Automata (pNets) is a machine...”
Get access
Get access
Get access
Conference Object -
20“...co-located with ICALP'08: 35th International Colloquium on Automata, Languages and Programming...”
Get access
Conference Object