Pages that link to "Item:Q4168070"
From MaRDI portal
The following pages link to Application of model theoretic games to discrete linear orders and finite automata (Q4168070):
Displaying 41 items.
- Model-checking hierarchical structures (Q414908) (← links)
- Schützenberger and Eilenberg theorems for words on linear orderings (Q414913) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Monadic partition logics and finite automata (Q671644) (← links)
- Ehrenfeucht-Fraïssé goes automatic for real addition (Q710741) (← links)
- On the definability of properties of finite graphs (Q791548) (← links)
- On the expressive power of temporal logic for infinite words (Q805240) (← links)
- Logic and rational languages of words indexed by linear orderings (Q987379) (← links)
- Semigroups and languages of dot-depth two (Q1109125) (← links)
- Classifying regular events in symbolic logic (Q1173413) (← links)
- Modal functions for concise definition of state machines and products (Q1183435) (← links)
- Logically defined subsets of \(\mathbb{N}{}^ k\) (Q1186601) (← links)
- Expressibility of output equals input. Negative and positive results (Q1323378) (← links)
- On the structure of random unlabelled acyclic graphs. (Q1426116) (← links)
- Characterizations of fuzzy finite automata. (Q1426246) (← links)
- Logic over words on denumerable ordinals (Q1604197) (← links)
- Query automata over finite trees (Q1607226) (← links)
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width (Q1764811) (← links)
- Logic, semigroups and automata on words (Q1817074) (← links)
- Games, equations and the dot-depth hierarchy (Q1823928) (← links)
- Star-free sets of words on ordinals (Q1854423) (← links)
- Towards a language theory for infinite N-free pomsets. (Q1874399) (← links)
- Regular sets of infinite message sequence charts (Q1887140) (← links)
- Inclusion relations between some congruences related to the dot-depth hierarchy (Q1917345) (← links)
- On distinguishing sets of structures by first-order sentences of minimal quantifier rank (Q2333677) (← links)
- Fixpoint logics over hierarchical structures (Q2429724) (← links)
- On weighted first-order logics with discounting (Q2453983) (← links)
- On uniformity within \(NC^ 1\) (Q2640342) (← links)
- Quantitative vs. weighted automata (Q2695484) (← links)
- Annual Meeting of the Association for Symbolic Logic, Los Angeles, 1989 (Q3478380) (← links)
- Extensions of an idea of McNaughton (Q3489464) (← links)
- The Algebraic Counterpart of the Wagner Hierarchy (Q3507423) (← links)
- FINE HIERARCHY OF REGULAR APERIODIC ω-LANGUAGES (Q3538855) (← links)
- Computational Semantics for Monadic Quantifiers (Q4236059) (← links)
- The dimension of the negation of transitive closure (Q4842619) (← links)
- On the Ehrenfeucht-Fraïssé game in theoretical computer science (Q5044763) (← links)
- First-order logic on finite trees (Q5096727) (← links)
- A Practical Approach to Courcelle's Theorem (Q5170276) (← links)
- Zero-one laws with variable probability (Q5287675) (← links)
- A game theoretical approach to the algebraic counterpart of the Wagner hierarchy : Part I (Q5321775) (← links)
- A Game Theoretical Approach to The Algebraic Counterpart of The Wagner Hierarchy : Part II (Q5321776) (← links)
