S. C. Kleene. Representation of events in nerve nets and finite automata. In C. E. Shannon and J. McCarthy, editors, Automata Studies, pages 3--41. Princeton University Press, 1956. Annals of Mathematics Studies 34. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Finite Semigroups and Recognizable Languages An Introduction - Pin (1995) (4 citations) (Correct)
.... but totally erroneous feeling From 1st Sept 1993, LITP, Universit e Paris VI, Tour 55 65, 4 Place Jussieu, 75252 Paris Cedex 05, FRANCE. E mail: pin litp.ibp.fr that if a problem has been reduced to a question about finite automata, then it should be easy to solve . Kleene s theorem [23] is usually considered as the foundation of the theory. It shows that the class of recognizable languages (i.e. recognized by finite automata) coincides with the class of rational languages, which are given by rational expressions. Rational expressions can be thought of as a generalization of ....
S. C. Kleene, Representation of Events in nerve nets and finite automata, in "Au- tomata Studies" C.E. Shannon and J. McCarthy eds.), Princeton University Press, Princeton, New Jersey, (1956) 3--42.
Finite Semigroups, Feedback, and the Letichevsky Criteria .. - Dömösi, Nehaniv, Rhodes (Correct)
....semigroups of all the languages L 2 L(X) with X some finite alphabet. The Eilenberg correspondence serves to systematize the study of regular languages algebraically. For instance, the pseudovariety Sgp of all finite semigroups corresponds to the variety of regular languages (Kleene s Theorem [7]) The pseudovariety A of aperiodic semigroups corresponds to the variety of star free languages (Schutzenberger s Theorem [14] A finite semigroup S is aperiodic if s for all s 2 S, i.e. every subgroup of S has only one element. Equivalently, by the first corollary of the Krohn Rhodes ....
S. C. KLEENE, Representation of events in nerve nets and finite automata. In C. E. Shannon and J. McCarthy (eds.), Automata Studies, Princeton University Press, pp. 3--41, 1956.
Structural Operational Semantics - And Bounded Nondeterminism (Correct)
....binary operators and in p. Clearly S(p) S(p q) S(q) s(p q) S(p) S(p q) and S(q) S(p q) So S is a strict stratification for the TSS of BPA ## . So by Theorem 1, the LTS associated to BPA ## is bounded nondeterministic. 4. 2 Binary Kleene star The binary Kleene star p # q [19] repeatedly executes p until it executes q. Using Theorem 1, we prove that the LTS associated to BPA # ## is bounded nondeterministic. We note that one of transition rules for the binary Kleene star below is not in De Simone format, so that Vaandrager s result in [30] on bounded nondeterminism of ....
S.C. Kleene. Representation of events in nerve nets and finite automata. In C.E. Shannon and J. McCarthy, editors, Automata Studies, pages 3--41. Princeton University Press, 1956.
Unknown - Esik Ing Olfsd (Correct)
....of operators to build new processes from existing ones, and of facilities for the description of recursive behaviours, e.g. terms of the form x. t to denote some distinguished solution of the equation x = t. Alternatively, one may use variations on the Kleene star operation first introduced in [4] to define iterative processes in a purely algebraic syntax. The latter approach has been advocated by Bergstra, Bethke and Ponse in [1, 2] and subsequently followed by several authors, notably Fokkink and his co workers. My aim in this talk will be to present a survey of some of the results ....
S. Kleene, Representation of events in nerve nets and finite automata, in Automata Studies, C. Shannon and J. McCarthy, eds., Princeton University Press, 1956, pp. 3--41.
KAT-ML: An Interactive Theorem Prover for Kleene Algebra with .. - Aboul-Hosn, Kozen Self-citation (Kleene) (Correct)
No context found.
Stephen C. Kleene. Representation of events in nerve nets and finite automata. In C. E. Shannon and J. McCarthy, editors, Automata Studies, pages 3--41. Princeton University Press, Princeton, N.J., 1956.
KAT-ML: An Interactive Theorem Prover for Kleene Algebra with .. - Aboul-Hosn, Kozen Self-citation (Kleene) (Correct)
No context found.
Kleene, S.C.: Representation of events in nerve nets and finite automata. In Shannon, C.E., McCarthy, J., eds.: Automata Studies. Princeton University Press, Princeton, N.J. (1956) 3--41
An Axiomatization of Arrays for Kleene Algebra with Tests - Aboul-Hosn Self-citation (Kleene) (Correct)
No context found.
Kleene, S.C.: Representation of events in nerve nets and finite automata. In Shannon, C.E., McCarthy, J., eds.: Automata Studies. Princeton University Press, Princeton, N.J. (1956) 3--41
Algebra of Flownomials; Part 1: Binary Flownomials; Basic Theory - Stefanescu Self-citation (Kleene) (Correct)
No context found.
S.C. Kleene. Representation of events in nerve nets and finite automata. In: C.E. Shannon and J. McCarthy, editors, Automata Studies, Princeton University Press, 1956. Annals of Mathematical Studies, Volume 34.
The Algebra of - Finite State Processes (Correct)
No context found.
S. C. Kleene. Representation of events in nerve nets and finite automata. In C. E. Shannon and J. McCarthy, editors, Automata Studies, pages 3--41. Princeton University Press, 1956. Annals of Mathematics Studies 34.
The Algebra of - Finite State Processes (Correct)
No context found.
S. C. Kleene. Representation of events in nerve nets and finite automata. In C. E. Shannon and J. McCarthy, editors, Automata Studies, pages 3--41. Princeton University Press, 1956. Annals of Mathematics Studies 34.
Extracting Symbolic Knowledge from Recurrent Neural Networks .. - Kolman, Margaliot (2006) (Correct)
No context found.
S. C. Kleene, "Representation of events in nerve nets and finite automata," in Automata Studies, C. E. Shannon and J. McCarthy, Eds. Princeton University Press, 1956, vol. 34, pp. 3--41.
A New Approach to Knowledge-Based Design of Recurrent Neural .. - Kolman, Margaliot (2006) (Correct)
No context found.
S. C. Kleene, "Representation of events in nerve nets and finite automata," in Automata Studies, C. E. Shannon and J. McCarthy, Eds. Princeton University Press, 1956, pp. 3--41.
A Survey of Sequential and Systolic Algorithms for the Algebraic.. - Fink (1992) (4 citations) (Correct)
No context found.
S. C. Kleene. Representation of events in nerve nets and finite automata. Annals Of Mathematics Studies 34, Automata Studies, eds: J. McCarthy and C. E. Shannon, 1956, pages 3--41.
Dimensions of Neural-symbolic Integration - A Structured Survey - Bader, Hitzler (Correct)
No context found.
S. C. Kleene. Representation of events in nerve nets and finite automata. In C. E. Shannon and J. McCarthy, editors, Automata Studies, volume 34 of Annals of Mathematics Studies, pages 3--41. Princeton University Press, Princeton, NJ, 1956.
Capturing ghost dependencies in Java sources - Lagorio (2002) (2 citations) (Correct)
No context found.
S. C. Kleene. Representation of events in nerve nets and finite automata. In C. E. Shannon and J. McCarthy, editors, Automata Studies, pages 3--41. Princeton University Press, Princeton, New Jersey, 1956.
Capturing ghost dependencies in Java sources - Lagorio (2004) (2 citations) (Correct)
No context found.
S. C. Kleene. Representation of events in nerve nets and finite automata. In C. E. Shannon and J. McCarthy, editors, Automata Studies, pages 3--41. Princeton University Press, Princeton, New Jersey, 1956. 94 JOURNAL OF OBJECT TECHNOLOGY VOL 3, NO. 11 CONCLUSIONS
Theorie Algebrique des Langages Formels Temps Reel - Dima (2001) (Correct)
No context found.
S. C. Kleene. Representation of events in nerve nets and finite automata. In C. Shannon and M. McCarthy, editors, Automata Studies, pages 3--41. Princeton University Press, 1956.
News and Trading Rules - Thomas (2003) (Correct)
No context found.
Stephen Kleene. Representation of events in nerve nets and finite automata. In Automata Studies, pages 3--42. Princeton University Press, Princeton, N.J.
A Methodology for Hardware Verification Based on Logic Simulation - Bryant (1991) (18 citations) (Correct)
No context found.
Kleene, S. C. Representation of events in nerve nets and finite automata. Automata Studies, Shannon, C. E., and McCarthy, J., Ed. Princeton University Press, Princeton, NJ, 1956, 3--41.
Syntactic Semigroups - Pin (1997) (24 citations) (Correct)
No context found.
S.C. Kleene, Representation of events in nerve nets and finite automata, in Automata Studies (C.E. Shannon and J. McCarthy eds.), Princeton University Press, Princeton, New Jersey, (1956), 3--42.
Residual Finite States Automata - Denis, Terlutte (2002) (Correct)
No context found.
S. C. Kleene. Representation of events in nerve nets and finite automata. In C. Shannon and J. McCarthy, editors, Automata Studies, Annals of Math. Studies 34. New Jersey, 1956. 31
Polynomial Closure and Unambiguous Product - Pin, Weil (1997) (6 citations) (Correct)
No context found.
S.C. Kleene, Representation of Events in nerve nets and finite automata, in "Au- tomata Studies" (C.E. Shannon and J. McCarthy eds.), Princeton University Press, Princeton, New Jersey, (1956) 3--42.
Process Algebra Primitives for File Transfer - Jan Bergstra Alban (1 citation) (Correct)
No context found.
S. C. Kleene. Representation of events in nerve nets and finite automata. In Automata Studies, pages 3--41. Princeton University Press, Princeton NJ, 1956.
A Multimedia Semantic Model for RTSP-Based Multimedia.. - Chen, Li, Shyu, Zhan.. (2002) (Correct)
No context found.
S. Kleene. Representation of Events in Nerve Nets and Finite Automata, Automata Studies. Princeton Univ. Press, Princeton, N.J., 1956.
Logic, Semigroups and Automata on Words. - Pin (Correct)
No context found.
S.C. Kleene, 1956, Representation of Events in nerve nets and finite automata, in "Au- tomata Studies" C.E. Shannon and J. McCarthy eds.), Princeton University Press, Princeton, New Jersey, 3--42.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC