120 search results - page 5 / 24 » Theorems for Free! |
CONCUR
2008
Springer
13 years 9 months ago
2008
Springer
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
CADE
1992
Springer
13 years 11 months ago
1992
Springer
Tableau
TAP
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. In this paper we report on our first experiences using the relational analysis provided by the Alloy tool with the theorem prover KIV in the context of specifications of ...
TCS
2008
13 years 7 months ago
2008
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
DCFS
2011
12 years 7 months ago
2011
We prove Kleene theorems for two subclasses of labelled product systems which are inspired from well-studied subclasses of 1bounded Petri nets. For product T-systems we define a c...