Pages that link to "Item:Q3287248"

The following pages link to Weak Second‐Order Arithmetic and Finite Automata (Q3287248):

Displaying 50 items.

• A logical approach to locality in pictures languages (Q295631) (← links)
• Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
• Logic programming approach to automata-based decision procedures (Q347398) (← links)
• Determinization of ordinal automata (Q383176) (← links)
• Schützenberger and Eilenberg theorems for words on linear orderings (Q414913) (← links)
• Aural pattern recognition experiments and the subregular hierarchy (Q438585) (← links)
• Testable and untestable classes of first-order formulae (Q440006) (← links)
• A finite state intersection approach to propositional satisfiability (Q442157) (← links)
• Impugning randomness, convincingly (Q454396) (← links)
• Static analysis of XML security views and query rewriting (Q462481) (← links)
• Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
• Realization problems for nonuniform cellular automata (Q475398) (← links)
• Positive existential definability of multiplication from addition and the range of a polynomial (Q503237) (← links)
• Multi-weighted automata and MSO logic (Q504993) (← links)
• On automatic subsets of the Gaussian integers (Q505037) (← links)
• Deciding game invariance (Q515578) (← links)
• On the path-width of integer linear programming (Q515665) (← links)
• Weighted automata and logics for infinite nested words (Q515684) (← links)
• Series-parallel languages on scattered and countable posets (Q533879) (← links)
• Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
• Undecidability of the first-order arithmetic \(A[P(x),2x,x+1]\) (Q599047) (← links)
• FO(ID) as an extension of DL with rules (Q604911) (← links)
• The sum of digits of squares (Q617867) (← links)
• Büchi context-free languages (Q627181) (← links)
• Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects (Q633299) (← links)
• Automata and logics over finitely varying functions (Q636272) (← links)
• Model-theoretic complexity of automatic structures (Q636281) (← links)
• The expressivity of autosegmental grammars (Q667923) (← links)
• Exact complexity bounds for ordinal addition (Q671516) (← links)
• Monadic partition logics and finite automata (Q671644) (← links)
• A note on the number of monadic quantifiers in monadic \(\Sigma ^{1}_{1}\) (Q673910) (← links)
• A Büchi-like theorem for weighted tree automata over multioperator monoids (Q692910) (← links)
• Ehrenfeucht-Fraïssé goes automatic for real addition (Q710741) (← links)
• First-order logics: some characterizations and closure properties (Q715044) (← links)
• The algebraic theory of Parikh automata (Q722218) (← links)
• Weighted automata and multi-valued logics over arbitrary bounded lattices (Q764336) (← links)
• On relation between linear temporal logic and quantum finite automata (Q783667) (← links)
• The monadic second-order logic of graphs. IV: Definability properties of equational graphs (Q807611) (← links)
• Relativizations for the logic-automata connection (Q815004) (← links)
• Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
• Timed hyperproperties (Q821560) (← links)
• Existential MSO over two successors is strictly weaker than over linear orders (Q837190) (← links)
• Weighted automata and weighted logics with discounting (Q840767) (← links)
• Definable transductions and weighted logics for texts (Q844894) (← links)
• Weighted automata and weighted logics on infinite words (Q845080) (← links)
• Factorization forests for infinite words and applications to countable scattered linear orderings (Q846364) (← links)
• Automata on linear orderings (Q859978) (← links)
• Skew and infinitary formal power series (Q860889) (← links)
• Weighted tree automata and weighted logics (Q860890) (← links)
• Expressiveness and complexity of graph logic (Q870359) (← links)