Monadic Second-Order Logic and Linear Orderings of Finite Structures
暂无分享,去创建一个
[1] Wolfgang Thomas,et al. Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[2] Bruno Courcelle,et al. Monadic Second-Order Definable Graph Transductions: A Survey , 1994, Theor. Comput. Sci..
[3] Bruno Courcelle,et al. The Monadic Second-Order Logic of Graphs VIII: Orientations , 1995, Ann. Pure Appl. Log..
[4] Hendrik Jan Hoogeboom,et al. MSO Definable Text Languages , 1994, MFCS.
[5] Bruno Courcelle,et al. Recognizable sets of graphs: equivalent definitions and closure properties , 1994, Mathematical Structures in Computer Science.
[6] Yves Métivier,et al. Asynchronous Mappings and Asynchronous Cellular Automata , 1993, Inf. Comput..
[7] Grzegorz Rozenberg,et al. Theory of Traces , 1988, Theor. Comput. Sci..
[8] Andrzej Proskurowski,et al. Separating subgraphs in k-trees: Cables and caterpillars , 1984, Discret. Math..
[9] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .
[10] Bruno Courcelle,et al. The Monadic Second order Logic of Graphs VI: on Several Representations of Graphs By Relational Structures , 1994, Discret. Appl. Math..
[11] Bruno Courcelle,et al. The Monadic Second-Order Logic of Graphs X: Linear Orderings , 1996, Theor. Comput. Sci..
[12] Edward Ochmanski,et al. Regular behaviour of concurrent systems , 1985, Bull. EATCS.
[13] Bruno Courcelle,et al. The Monadic Second-Order Logic of Graphs V: On Closing the Gap Between Definability and Recognizability , 1991, Theor. Comput. Sci..
[14] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[15] Bruno Courcelle,et al. The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..