J. Berstel. Transductions and Contex-Free Languages. Teubner. Stuttgart, 1979. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Two-Dimensional Languages - Giammarresi, Restivo (1997) (31 citations) (Correct)
....notion of tiling recognizability. Recall that this notion takes as a starting point the characterization of recognizable string languages as a projection of local languages. For context free string languages there exists a similar characterization, the Chomsky Schutzenberger theorem (cf. 5] or [2]) stating that a string language S is context free if and only if there exist a Dyck language Dn over n pairs of parentheses , a recognizable language R and an alphabetic morphism OE such that: S = OE(D n R) If we take this characterization as a starting point for a generalization of the ....
J. Berstel. Transductions and Contex-Free Languages. Teubner. Stuttgart, 1979.
Some Undecidability Results related to the Star Problem in Trace.. - Kirsten (1998) (2 citations) (Correct)
....language L is called connected iff every trace in L is connected. A trace Gamma u v Delta in P3 or C4 is connected iff u or v is the empty word . 2. 2 Rational Sets Rational expressions and rational sets were introduced by Kleene in 1956 [19] I give a brief definition, I appreciate, e.g. [2, 10] for deeper understanding. Definition 2.2 Assume a monoid IM. The set of rational expressions over IM, denoted by REX(IM) is the least set which contains the symbol Omega Gamma every element a of IM, and for every r; r 1 ; r 2 2 REX(IM) REX(IM) also contains (r ) r 1 [ r 2 ) and (r 1 r 2 ....
....concept of recognizability describes a formal method how to use finite machines to deal with infinite objects. It originates from Mezei and Wright from 1967 [26] There are numerous equivalent definitions. I introduce it as far as we use it in this paper, for a more general overview I recommend [2, 10]. I took most of the contents of this section from there. 2.3 Recognizable Sets 5 Definition 2.6 Assume a monoid IM. An IM automaton is a triple A = Q; h; F ] where Q is a finite monoid, h is a homomorphism h : IM Q and F is a subset of Q. The language of an IM automaton A is defined by L(A) ....
[Article contains additional citation context not shown here]
J. Berstel. Transductions and Contex-Free Languages. B. G. Teubner, Stuttgart, 1979.
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