On Total Regulators Generated by Derivation Relations
暂无分享,去创建一个
[1] Michel Latteux,et al. Commutative One-Counter Languages are Regular , 1984, J. Comput. Syst. Sci..
[2] Keijo Ruohonen. A note on off-line machines with 'brownian' input heads , 1984, Discret. Appl. Math..
[3] Maurice Nivat,et al. Quelques problèmes ouverts en théorie des langages algébriques , 1979, RAIRO Theor. Informatics Appl..
[4] Graham Higman,et al. Ordering by Divisibility in Abstract Algebras , 1952 .
[5] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .
[6] Christian Choffrut,et al. On extendibility of unavoidable sets , 1984, Discret. Appl. Math..
[7] Jan van Leeuwen,et al. Effective constructions in well-partially- ordered free monoids , 1978, Discret. Math..
[8] David Haussler,et al. On Regularity of Context-Free Languages , 1983, Theor. Comput. Sci..
[9] Michael G. Main,et al. An Infinite Square-Free co-CFL , 1985, Inf. Process. Lett..
[10] Joseph B. Kruskal,et al. The Theory of Well-Quasi-Ordering: A Frequently Discovered Concept , 1972, J. Comb. Theory, Ser. A.
[11] Nachum Dershowitz,et al. Orderings for term-rewriting systems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[12] L. H. Haines. On free monoids partially ordered by embedding , 1969 .
[13] J. Conway. Regular algebra and finite machines , 1971 .