Alternating complexity of counting first-order logic for the subword order
暂无分享,去创建一个
[1] Graham Higman,et al. Ordering by Divisibility in Abstract Algebras , 1952 .
[2] Imre Simon,et al. Piecewise testable events , 1975, Automata Theory and Formal Languages.
[3] J. Ferrante,et al. The computational complexity of logical theories , 1979 .
[4] Philippe Schnoebelen,et al. Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..
[5] Dietrich Kuske,et al. Theories of orders on the set of words , 2006, RAIRO Theor. Informatics Appl..
[6] Victor L. Selivanov,et al. Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests , 2007, J. Log. Comput..
[7] R. McKenzie,et al. Definability in substructure orderings, I: finite semilattices , 2009 .
[8] Victor L. Selivanov,et al. Definability in the h-quasiorder of labeled forests , 2009, Ann. Pure Appl. Log..
[9] Victor L. Selivanov,et al. Definability in the Subword Order , 2010, CiE.
[10] Philippe Schnoebelen,et al. Decidability in the Logic of Subsequences and Supersequences , 2015, FSTTCS.
[11] Tomás Masopust,et al. Piecewise Testable Languages and Nondeterministic Automata , 2016, MFCS.
[12] Philippe Schnoebelen,et al. Decidability, complexity, and expressiveness of first-order logic over the subword ordering , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).
[13] Ramanathan S. Thinniyam. Definability of Recursive Predicates in the Induced Subgraph Order , 2017, ICLA.
[14] Michaël Thomazo,et al. On Boolean combinations forming piecewise testable languages , 2017, Theor. Comput. Sci..
[15] Ramanathan S. Thinniyam. Defining Recursive Predicates in Graph Orders , 2018, Log. Methods Comput. Sci..
[16] Philippe Schnoebelen,et al. The height of piecewise-testable languages and the complexity of the logic of subwords , 2015, Log. Methods Comput. Sci..
[17] Georg Zetzsche,et al. Languages ordered by the subword order , 2019, FoSSaCS.
[18] Dietrich Kuske,et al. The Subtrace Order and Counting First-Order Logic , 2020, CSR.