Weak Second‐Order Arithmetic and Finite Automata
From MaRDI portal
Publication:3287248
Cites work
- A theory of computation based on quantum logic. I
- Approximation and universality of fuzzy Turing machines
- Automata theory and its applications
- Automata theory based on quantum logic. II.
- Automata theory based on quantum logic: reversibilities and pushdown automata
- Decision Problems of Finite Automata Design and Related Arithmetics
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 438994 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 640548 (Why is no real title available?)
- scientific article; zbMATH DE number 3807678 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- Notes on automata theory based on quantum logic
- On finite monoids having only trivial subgroups
- Weak Second‐Order Arithmetic and Finite Automata
- Weighted automata and weighted logics
Cited in
(only showing first 100 items - show all)- Mathematical logic and quantum finite state automata
- Don't care words with an application to the automata-based approach for real addition
- Decidability of extended theories of addition of the natural numbers and the integers
- A logical approach of Petri net languages
- Semigroups and languages of dot-depth two
- Inverse monoids of dot-depth two
- Complexity of algorithms and computations
- Classifying regular events in symbolic logic
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
- A regular characterization of graph languages definable in monadic second-order logic
- Logically defined subsets of \(\mathbb{N}{}^ k\)
- Regular languages in \(NC\)
- Formulas, regular languages and Boolean circuits
- The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable
- Theories of automata on \(\omega\)-tapes: a simplified approach
- An axiom system for the weak monadic second order theory of two successors
- Presburgerness of predicates regular in two number systems
- Monadic second-order definable graph transductions: a survey
- Modulo-counting quantifiers over finite trees
- On an approach to functional specification of automata systems. II
- On the dependence of numeration systems associated to the powers of a Pisot number
- ALOGTIME and a conjecture of S. A. Cook
- Monadic second-order definable text languages
- On Pascal triangles modulo a prime power
- Theories of generalized Pascal triangles
- Ehrenfeucht games and ordinal addition
- Logical description of context-free graph languages
- Bertrand numeration systems and recognizability
- Ambiguity in omega context free languages
- Borel hierarchy and omega context free languages.
- The definable criterion for definability in Presburger arithmetic and its applications.
- A descriptive complexity approach to the linear hierarchy.
- XML with data values: Typechecking revisited.
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars
- Logic over words on denumerable ordinals
- Query automata over finite trees
- LARS: a logic-based framework for analytic reasoning over streams
- Regular language representations in the constructive type theory of Coq
- Generalizing input-driven languages: theoretical and practical benefits
- Explicit linear kernels for packing problems
- Copyless cost-register automata: structure, expressiveness, and closure properties
- The descriptive complexity of decision problems through logics with relational fixed-point and capturing results
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics
- Ostrowski numeration systems, addition, and finite automata
- Characterizations of complete residuated lattice-valued finite tree automata
- Weak Muller acceptance conditions for tree automata
- It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base
- Attribute grammars for unranked trees as a query language for structured documents
- Weighted register automata and weighted logic on data words
- A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties
- Bounds in the propagation of selection into logic programs
- Decidability results for metric and layered temporal logics
- Logic, semigroups and automata on words
- The monadic second-order logic of graphs. VIII: Orientations
- On an approach to functional specification of automata systems. III
- Product interval automata
- Automata techniques for query inference machines
- Uniform and nonuniform recognizability.
- Star-free sets of words on ordinals
- Languages defined with modular counting quantifiers
- An operational and denotational approach to non-context-freeness
- wMSO theories as grammar formalisms
- On omega context free languages which are Borel sets of infinite rank.
- Describing parameterized complexity classes
- On iterating linear transformations over recognizable sets of integers
- Closure properties of locally finite \(\omega\)-languages
- Arithmetical definability and computational complexity
- The complexity of first-order and monadic second-order logic revisited
- Regular sets of infinite message sequence charts
- Approach to functional specification of automaton systems. I
- Inclusion relations between some congruences related to the dot-depth hierarchy
- Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
- Arity and alternation in second-order logic
- Weighted automata and weighted MSO logics for average and long-time behaviors
- Additive number theory via automata theory
- Automatic sequences based on Parry or Bertrand numeration systems
- Robustness of Pisot-regular sequences
- Subsequence versus substring constraints in sequence pattern languages
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates
- Kleene and Büchi theorems for weighted forest languages over M-monoids
- Weighted operator precedence languages
- Logic for \(\omega\)-pushdown automata
- Algebraic model checking for discrete linear dynamical systems
- McCarthy-Kleene fuzzy automata and MSO logics
- Effective categoricity of automatic equivalence and nested equivalence structures
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
- Operator precedence temporal logic and model checking
- On the expressiveness of Büchi arithmetic
- First-order rewritability of ontology-mediated queries in linear temporal logic
- Event clock message passing automata: a logical characterization and an emptiness checking algorithm
- Pro-aperiodic monoids via saturated models
- Streamable regular transductions
- On the width of regular classes of finite structures
- On decidability of list structures
- On distinguishing sets of structures by first-order sentences of minimal quantifier rank
- Array theory of bounded elements and its applications
- A link between multioperator and tree valuation automata and logics
- Weighted automata and weighted logics
- Complementation of rational sets on scattered linear orderings of finite rank
- Arity and alternation: a proper hierarchy in higher order logics
This page was built for publication: Weak Second‐Order Arithmetic and Finite Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3287248)
