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.
- Weak Muller acceptance conditions for tree automata (Q1770388) (← links)
- It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base (Q1773328) (← links)
- Attribute grammars for unranked trees as a query language for structured documents (Q1776378) (← links)
- Weighted register automata and weighted logic on data words (Q1786559) (← links)
- A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties (Q1797777) (← links)
- Bounds in the propagation of selection into logic programs (Q1813949) (← links)
- Decidability results for metric and layered temporal logics (Q1815429) (← links)
- Logic, semigroups and automata on words (Q1817074) (← links)
- The monadic second-order logic of graphs. VIII: Orientations (Q1842126) (← links)
- On an approach to functional specification of automata systems. III (Q1842385) (← links)
- Product interval automata (Q1847544) (← links)
- Automata techniques for query inference machines (Q1849855) (← links)
- Uniform and nonuniform recognizability. (Q1853746) (← links)
- Star-free sets of words on ordinals (Q1854423) (← links)
- Languages defined with modular counting quantifiers (Q1854424) (← links)
- An operational and denotational approach to non-context-freeness (Q1870568) (← links)
- wMSO theories as grammar formalisms (Q1870569) (← links)
- On omega context free languages which are Borel sets of infinite rank. (Q1874398) (← links)
- Describing parameterized complexity classes (Q1877556) (← links)
- On iterating linear transformations over recognizable sets of integers (Q1884908) (← links)
- Closure properties of locally finite \(\omega\)-languages (Q1885033) (← links)
- Arithmetical definability and computational complexity (Q1885035) (← links)
- The complexity of first-order and monadic second-order logic revisited (Q1886318) (← links)
- Regular sets of infinite message sequence charts (Q1887140) (← links)
- Approach to functional specification of automaton systems. I (Q1895045) (← links)
- Inclusion relations between some congruences related to the dot-depth hierarchy (Q1917345) (← links)
- Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems (Q1919534) (← links)
- Arity and alternation in second-order logic (Q1919768) (← links)
- Weighted automata and weighted MSO logics for average and long-time behaviors (Q1932173) (← links)
- Additive number theory via automata theory (Q1987517) (← links)
- Automatic sequences based on Parry or Bertrand numeration systems (Q2002037) (← links)
- Robustness of Pisot-regular sequences (Q2020014) (← links)
- Subsequence versus substring constraints in sequence pattern languages (Q2022305) (← links)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
- Kleene and Büchi theorems for weighted forest languages over M-monoids (Q2051789) (← links)
- Weighted operator precedence languages (Q2064530) (← links)
- Logic for \(\omega\)-pushdown automata (Q2064532) (← links)
- Algebraic model checking for discrete linear dynamical systems (Q2112097) (← links)
- McCarthy-Kleene fuzzy automata and MSO logics (Q2182728) (← links)
- Effective categoricity of automatic equivalence and nested equivalence structures (Q2195573) (← links)
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic (Q2208242) (← links)
- Operator precedence temporal logic and model checking (Q2215961) (← links)
- On the expressiveness of Büchi arithmetic (Q2233416) (← links)
- First-order rewritability of ontology-mediated queries in linear temporal logic (Q2238711) (← links)
- Event clock message passing automata: a logical characterization and an emptiness checking algorithm (Q2248059) (← links)
- Pro-aperiodic monoids via saturated models (Q2279939) (← links)
- Streamable regular transductions (Q2286735) (← links)
- On the width of regular classes of finite structures (Q2305404) (← links)
- On decidability of list structures (Q2332060) (← links)
- On distinguishing sets of structures by first-order sentences of minimal quantifier rank (Q2333677) (← links)
