The Complexity of Verbal Languages over Groups
暂无分享,去创建一个
[1] Daniel Reidenbach,et al. A non-learnable class of E-pattern languages , 2006, Theor. Comput. Sci..
[2] Alfred V. Aho,et al. Indexed Grammars—An Extension of Context-Free Grammars , 1967, SWAT.
[3] Alexei G. Myasnikov,et al. From automatic structures to automatic groups , 2011, ArXiv.
[4] David B. A. Epstein,et al. Word processing in groups , 1992 .
[5] Daniel Reidenbach. The ambiguity of morphisms in free monoids and its impact on algorithmic properties of pattern languages , 2006, Ausgezeichnete Informatikdissertationen.
[6] Robert H. Gilman,et al. Geometric and Computational Perspectives on Infinite Groups , 1995 .
[7] N. Nikolov. Algebraic properties of profinite groups , 2011, 1108.5130.
[8] G. Makanin. EQUATIONS IN A FREE GROUP , 1983 .
[9] Alexei G. Myasnikov,et al. On Rationality of Verbal Subsets in a Group , 2011, Theory of Computing Systems.
[10] Robert H. Gilman,et al. Formal languages and infinite groups , 1995, Geometric and Computational Perspectives on Infinite Groups.
[11] Dana Angluin,et al. Finding Patterns Common to a Set of Strings , 1980, J. Comput. Syst. Sci..
[12] J. L. Britton. Review: G. S. Makanin, Equations in a Free Group , 1986 .
[13] Sanjay Jain,et al. Regular patterns, regular languages and context-free languages , 2010, Inf. Process. Lett..
[14] Alexei G. Myasnikov,et al. Definable Sets in a hyperbolic Group , 2011, Int. J. Algebra Comput..
[15] A. Myasnikov,et al. Elementary theory of free non-abelian groups , 2006 .