96 search results - page 1 / 20 » On Several Proofs of the Recognizability Theorem |
CAI
2009
Springer
14 years 5 months ago
2009
Springer
FCT
1999
Springer
14 years 3 months ago
1999
Springer
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directi...
IJCAI
1997
14 years 7 days ago
1997
We present a design for an automated theorem prover that controls its search based on ideas from several areas of artificial intelligence (AI). The combination of case-based reaso...
IJCM
2010
13 years 9 months ago
2010
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which refl...
ENTCS
2006
13 years 11 months ago
2006
We present a proof technique in -calculus that can facilitate inductive reasoning on -terms by separating certain -developments from other -reductions. We give proofs based on thi...