Pages that link to "Item:Q3287248"
From MaRDI portal
The following pages link to Weak Second‐Order Arithmetic and Finite Automata (Q3287248):
Displaying 50 items.
- Inferring answers to queries (Q927868) (← links)
- Topological complexity of locally finite \(\omega\)-languages (Q944222) (← links)
- Muller message-passing automata and logics (Q948076) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Logic and rational languages of words indexed by linear orderings (Q987379) (← links)
- Mathematical logic and quantum finite state automata (Q1017412) (← links)
- Don't care words with an application to the automata-based approach for real addition (Q1028730) (← links)
- Decidability of extended theories of addition of the natural numbers and the integers (Q1071748) (← links)
- A logical approach of Petri net languages (Q1083861) (← links)
- Semigroups and languages of dot-depth two (Q1109125) (← links)
- Inverse monoids of dot-depth two (Q1124363) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- Classifying regular events in symbolic logic (Q1173413) (← links)
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232) (← links)
- A regular characterization of graph languages definable in monadic second-order logic (Q1177179) (← links)
- Logically defined subsets of \(\mathbb{N}{}^ k\) (Q1186601) (← links)
- Regular languages in \(NC\) (Q1191027) (← links)
- Formulas, regular languages and Boolean circuits (Q1193413) (← links)
- The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable (Q1202930) (← links)
- Theories of automata on \(\omega\)-tapes: a simplified approach (Q1211504) (← links)
- An axiom system for the weak monadic second order theory of two successors (Q1253650) (← links)
- Presburgerness of predicates regular in two number systems (Q1259594) (← links)
- Monadic second-order definable graph transductions: a survey (Q1325847) (← links)
- Modulo-counting quantifiers over finite trees (Q1325850) (← links)
- On an approach to functional specification of automata systems. II (Q1333690) (← links)
- On the dependence of numeration systems associated to the powers of a Pisot number (Q1351449) (← links)
- ALOGTIME and a conjecture of S. A. Cook (Q1353980) (← links)
- Monadic second-order definable text languages (Q1361884) (← links)
- On Pascal triangles modulo a prime power (Q1377632) (← links)
- Theories of generalized Pascal triangles (Q1377634) (← links)
- Ehrenfeucht games and ordinal addition (Q1377635) (← links)
- Logical description of context-free graph languages (Q1384534) (← links)
- Bertrand numeration systems and recognizability (Q1391295) (← links)
- Ambiguity in omega context free languages (Q1399989) (← links)
- Borel hierarchy and omega context free languages. (Q1401165) (← links)
- The definable criterion for definability in Presburger arithmetic and its applications. (Q1401169) (← links)
- A descriptive complexity approach to the linear hierarchy. (Q1401413) (← links)
- XML with data values: Typechecking revisited. (Q1401966) (← links)
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars (Q1582010) (← links)
- Logic over words on denumerable ordinals (Q1604197) (← links)
- Query automata over finite trees (Q1607226) (← links)
- LARS: a logic-based framework for analytic reasoning over streams (Q1648076) (← links)
- Regular language representations in the constructive type theory of Coq (Q1663246) (← links)
- Generalizing input-driven languages: theoretical and practical benefits (Q1706605) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- Copyless cost-register automata: structure, expressiveness, and closure properties (Q1740663) (← links)
- The descriptive complexity of decision problems through logics with relational fixed-point and capturing results (Q1744448) (← links)
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics (Q1749477) (← links)
- Ostrowski numeration systems, addition, and finite automata (Q1750300) (← links)
- Characterizations of complete residuated lattice-valued finite tree automata (Q1759726) (← links)
