On the Height of Towers of Subsequences and Prefixes
暂无分享,去创建一个
[1] Thomas Place,et al. Separation and the Successor Relation , 2015, STACS.
[2] Michaël Thomazo,et al. Alternating Towers and Piecewise Testable Separators , 2014, ArXiv.
[3] Wim Martens,et al. A Characterization for Decidable Separability by Piecewise Testable Languages , 2014, Discret. Math. Theor. Comput. Sci..
[4] Tomás Masopust,et al. On Upper and Lower Bounds on the Length of Alternating Towers , 2014, MFCS.
[5] Wim Martens,et al. Separability by Short Subsequences and Subwords , 2015, ICDT.
[6] Graham Higman,et al. Ordering by Divisibility in Abstract Algebras , 1952 .
[7] Philippe Schnoebelen,et al. On the index of Simon's congruence for piecewise testability , 2015, Inf. Process. Lett..
[8] Wim Martens,et al. Efficient Separability of Regular Languages by Subsequences and Suffixes , 2013, ICALP.
[9] Howard Straubing,et al. A Generalization of the Schützenberger Product of Finite Monoids , 1981, Theor. Comput. Sci..
[10] Thomas Place,et al. Separating Regular Languages by Piecewise Testable and Unambiguous Languages , 2013, MFCS.
[11] Tomás Masopust,et al. Separability by Piecewise Testable Languages is PTime-Complete , 2017, Theor. Comput. Sci..
[12] Markus Krötzsch,et al. Deciding Universality of ptNFAs is PSpace-Complete , 2018, SOFSEM.
[13] Denis Thérien,et al. Classification of Finite Monoids: The Language Approach , 1981, Theor. Comput. Sci..
[14] Thomas Schwentick,et al. BonXai , 2017, ACM Trans. Database Syst..
[15] Jorge Almeida,et al. Implicit operations on finite J-trivial semigroups and a conjecture of I. Simon , 1991 .
[16] Jacques Stern,et al. Characterizations of Some Classes of Regular Events , 1985, Theor. Comput. Sci..
[17] Jorge Almeida,et al. Finite Semigroups and Universal Algebra , 1995 .
[18] Thomas Place,et al. Going Higher in the First-Order Quantifier Alternation Hierarchy on Words , 2014, ICALP.