Siromoney, R. "On equal matrix languages," Informatica and Control, Vol. 14 (1969), 135-151. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Shuffle on Trajectories: Syntactic Constraints - Mateescu, Rozenberg, Salomaa (1998) (7 citations) (Correct)
....morphisms. A slip AFL is an AFL, A, with the property that all languages from A are semilinear languages, see [12] Examples of slip AFL are, among others, the family of context free languages, the family of simple matrix languages, the family of languages of 4 equal matrix grammars, see [44], the family of finite degree state languages, see [23] An anti AFL is a family of languages that is not closed under any of the AFL operations. For all other notions and results in formal languages that are used in this paper we refer the reader to [43] The reader may consult [34] 35] 2] ....
R. Siromoney, "On equal matrix languages", Information and Control,
Two-Dimensional Languages - Giammarresi, Restivo (1997) (31 citations) (Correct)
....2 identified to a conventional automaton when restricted to one row (or one column) pictures. Moreover, the family of picture languages recognized by this model of automaton satisfy many important properties. Different systems to generate pictures using grammars have been also explored (cf. [31, 32, 33, 35, 34, 36, 29, 30, 39]) However, in the finite state case, this approach is shown to be less powerful than others. Another possible generalization is to describe picture languages by logic formulas. Recently, W. Thomas gave a general formalism to describe graphs (and, in particular, pictures) as model theoretical ....
....languages are not related by inclusion relations. In fact in [18] there are examples of picture languages recognized by a DFA and not recognized by any 2DOTA and vice versa. 5 Grammars Different systems for generating pictures using grammars have been explored in the literature (cf. for example, [31, 32, 33, 35, 34, 36, 29, 30, 39]) We consider here models that consist of two sets of rewriting rules: horizontal and vertical rules, respectively, that correspond either to a context free or regular (conventional) grammars. These models operate by first generating a (horizontal) string oe using the horizontal rules; then ....
[Article contains additional citation context not shown here]
R. Siromoney. On equal matrix languages. Info. and Control 14, pp. 135--151, 1969. 41
On the Leftmost Derivation in Matrix Grammars - Dassow, Fernau, al. (1997) (Correct)
.... rightmost fashion, characterize the queue languages, see [4, 16, 17, 26] Finally, let us mention that both the characterization and the simulation of free queue automata by matrix grammars with certain leftmost restrictions yields the strict inclusion of the family of equal matrix grammars [27], i.e. regular simple matrix grammars in the sense of [7] within any of these simulating matrix mechanisms by [5] 9 Summary and prospects In this paper, we investigated leftmost derivations in matrix grammars systematically. Starting with a total number of 24 matrix language classes plus the ....
R. Siromoney, On equal matrix languages, Inform. Control, 14 (1969), 133-151.
Pei Hsia and Raymond T. Yeh - March Tr- Pei (Correct)
No context found.
Siromoney, R. "On equal matrix languages," Informatica and Control, Vol. 14 (1969), 135-151.
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