A generalized approach to formal languages
作者： T.S.E. Maibaum
DOI: 10.1016/S0022-0000(74)80031-0
关键词: Context (language use) 、 Discrete mathematics 、 Formal language 、 Philosophy of language 、 Mathematics 、 Context-free language 、 Finite-state machine 、 Set (abstract data type) 、 Generalization 、 Special case
摘要: A generalization of ranked alphabets, many-sorted is studied. The concepts finite automaton, regular, recognizable, equational, and context free languages are generalized to sets over these new alphabets. It shown that the derivation trees a set always characterized by some recognizable related alphabet. Previous theory drawn as special case results advanced. number suggestions about language made.
elsevier.com
sci-hub.se 参考文章(17)
John E. Hopcroft, Jeffrey D. Ullman, Formal Languages and Their Relation to Automata ,(1969)
William C. Rounds, Mappings and grammars on trees Theory of Computing Systems \/ Mathematical Systems Theory. ,vol. 4, pp. 257- 287 ,(1970) , 10.1007/BF01695769
T. S. E. Maibaum, The characterisation of the derivation trees of context free sets of terms as regular sets 13th Annual Symposium on Switching and Automata Theory (swat 1972). pp. 224- 230 ,(1972) , 10.1109/SWAT.1972.26
Walter S. Brainerd, Tree Generating Regular Systems Information & Computation. ,vol. 14, pp. 217- 231 ,(1969) , 10.1016/S0019-9958(69)90065-5
G. Grätzer, Free Σ-structures Transactions of the American Mathematical Society. ,vol. 135, pp. 517- 542 ,(1969) , 10.1090/S0002-9947-1969-0232724-0
Alfred V. Aho, Nested Stack Automata Journal of the ACM. ,vol. 16, pp. 383- 406 ,(1969) , 10.1145/321526.321529
Samuel Eilenberg, Jesse B. Wright, Automata in general algebras Information & Computation. ,vol. 11, pp. 452- 470 ,(1967) , 10.1016/S0019-9958(67)90670-5
J. W. Thatcher, J. B. Wright, Generalized finite automata theory with an application to a decision problem of second-order logic Theory of Computing Systems \/ Mathematical Systems Theory. ,vol. 2, pp. 57- 81 ,(1968) , 10.1007/BF01691346
Philip J. Higgins, Algebras with a Scheme of Operators Mathematische Nachrichten. ,vol. 27, pp. 115- 132 ,(1963) , 10.1002/MANA.19630270108
William C. Rounds, Tree-oriented proofs of some theorems on context-free and indexed languages symposium on the theory of computing. pp. 109- 116 ,(1970) , 10.1145/800161.805156