Find link

language:

Find link is a tool written by Edward Betts.

searching for Monadic second-order logic 13 found (37 total)

alternate case: monadic second-order logic

Trémaux tree (2,302 words) [view diff] exact match in snippet view article find links to article

is a planar graph. A characterization of Trémaux trees in the monadic second-order logic of graphs allows graph properties involving orientations to be

Matching polynomial (882 words) [view diff] exact match in snippet view article find links to article

parameter complexity of graph enumeration problems definable in monadic second-order logic" (PDF), Discrete Applied Mathematics, 108 (1–2): 23–52, doi:10

Hosoya index (894 words) [view diff] exact match in snippet view article find links to article

parameter complexity of graph enumeration problems definable in monadic second-order logic" (PDF), Discrete Applied Mathematics, 108 (1–2): 23–52, doi:10

K-outerplanar graph (564 words) [view diff] exact match in snippet view article find links to article

bounded treewidth by finite state tree automata is definable in the monadic second-order logic of graphs, has been proven for the k {\displaystyle k} -outerplanar

Operator-precedence grammar (1,283 words) [view diff] exact match in snippet view article find links to article

characterizations based on an equivalent form of automata and monadic second-order logic. Aho, Sethi & Ullman 1988, p. 203 Aho, Sethi & Ullman 1988, pp

Bramble (graph theory) (955 words) [view diff] exact match in snippet view article

brambles, grid-like minors, and parameterized intractability of monadic second-order logic", Proceedings of the Twenty-First Annual ACM-SIAM Symposium on

International Conference on Concurrency Theory (954 words) [view diff] no match in snippet view article find links to article

Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic." (CONCUR 1996) Roberto Segala & Nancy Lynch: "Probabilistic Simulations

Transversal (combinatorics) (1,655 words) [view diff] case mismatch in snippet view article

Bruno Courcelle; Joost Engelfriet (2012). Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach. Cambridge University Press. p

George Boolos (2,185 words) [view diff] exact match in snippet view article find links to article

Boolos argued that if one reads the second-order variables in monadic second-order logic plurally, then second-order logic can be interpreted as having

Cograph (2,689 words) [view diff] exact match in snippet view article find links to article

Courcelle's theorem may be used to test any property in the monadic second-order logic of graphs (MSO1) on cographs in linear time. The problem of testing

Nested word (3,063 words) [view diff] exact match in snippet view article find links to article

over nested words are exactly the set of languages described by monadic second-order logic with two unary predicates call and return, linear successor and

Regular numerical predicate (2,190 words) [view diff] no match in snippet view article find links to article

{\displaystyle P} are regular. The same property would hold for the monadic second order logic, and with modular quantifiers. The following property allows to

Cyclic order (6,392 words) [view diff] case mismatch in snippet view article find links to article

Courcelle, Bruno; Engelfriet, Joost (April 2011), Graph Structure and Monadic Second-Order Logic, a Language Theoretic Approach (PDF), Cambridge University Press