Decision Problems of Finite Automata Design and Related Arithmetics
From MaRDI portal
Cites work
Cited in
(only showing first 100 items - show all)- Mathematical logic and quantum finite state automata
- In memoriam Calvin C. Elgot
- Classifying regular events in symbolic logic
- A regular characterization of graph languages definable in monadic second-order logic
- On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Expressibility in a restricted second-order arithmetic
- Monadic second-order definable graph transductions: a survey
- Modulo-counting quantifiers over finite trees
- Logical description of context-free graph languages
- A generalization of the theory of incompletely specified machines
- A descriptive complexity approach to the linear hierarchy.
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars
- Computational complexity of decision problems on self-verifying finite automata
- 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
- 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
- Logic, semigroups and automata on words
- Uniform and nonuniform recognizability.
- An operational and denotational approach to non-context-freeness
- wMSO theories as grammar formalisms
- Arithmetical definability and computational complexity
- Inclusion relations between some congruences related to the dot-depth hierarchy
- Weighted automata and weighted MSO logics for average and long-time behaviors
- Weighted operator precedence languages
- Logic for \(\omega\)-pushdown automata
- Weighted automata
- Automata on finite trees
- Shelah-Stupp's and Muchnik's iterations revisited
- Trading transforms of non-weighted simple games and integer weights of weighted simple games
- McCarthy-Kleene fuzzy automata and MSO logics
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
- First-order rewritability of ontology-mediated queries in linear temporal logic
- Event clock message passing automata: a logical characterization and an emptiness checking algorithm
- Streamable regular transductions
- On the width of regular classes of finite structures
- A link between multioperator and tree valuation automata and logics
- Weighted automata and weighted logics
- The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy
- Weighted logics for unranked tree automata
- Isomorphisms of scattered automatic linear orders
- The complexity of computing the behaviour of lattice automata on infinite trees
- Algebraic recognizability of regular tree languages
- Message-passing automata are expressively equivalent to EMSO logic
- The monadic quantifier alternation hierarchy over grids and graphs
- Maximin sequential chains
- Equidivisible semigroups
- Generalized sequential machine maps
- Tree acceptors and some of their applications
- AFL with the semilinear property
- A reducibility for the dot-depth hierarchy
- An algebra and a logic for \(NC^ 1\)
- Computability by monadic second-order logic
- Rational elements of summation semirings
- Deciding FO-definability of regular languages
- Quantitative vs. weighted automata
- Quantifier alternation for infinite words
- A class of automata for the verification of infinite, resource-allocating behaviours
- Weighted automata and logics on infinite graphs
- On finite and polynomial ambiguity of weighted tree automata
- Decision Problems for Finite Automata over Infinite Algebraic Structures
- The isomorphism problem on classes of automatic structures with transitive relations
- Decidability of a hybrid duration calculus
- Logics for weighted timed pushdown automata
- A logical approach to locality in pictures languages
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
- Where automatic structures benefit from weighted automata
- A logical characterization of timed pushdown languages
- Some Remarks on Abstract Machines
- Weak Second‐Order Arithmetic and Finite Automata
- Classes of Predictably Computable Functions
- Communicating finite-state machines and two-variable logic
- MK-fuzzy automata and MSO logics
- A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
- Logic programming approach to automata-based decision procedures
- Weighted Automata and Weighted Logics with Discounting
- The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey
- From Philosophical to Industrial Logics
- Weighted versus Probabilistic Logics
- Weighted Timed MSO Logics
- Automatic Structures of Bounded Degree Revisited
- CARDINAL ARITHMETIC IN THE STYLE OF BARON VON MÜNCHHAUSEN
- Regular prefix relations
- Complexity classes and theories of finite models
- First-order properties of trees, star-free expressions, and aperiodicity
- Aural pattern recognition experiments and the subregular hierarchy
- A finite state intersection approach to propositional satisfiability
- scientific article; zbMATH DE number 2051828 (Why is no real title available?)
- The covering problem
- The product of rational languages
- Complementation of Branching Automata for Scattered and Countable N-Free Posets
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Logical definability of some rational trace languages
- Verifying a network invariant for all configurations of the Futurebus+ cache coherence protocol
- Networks of processes with parameterized state space
- A model theoretic description of tree adjoining grammars
- It is easy to be wise after the event: communicating finite-state machines capture first-order logic with ``happened before
- Weighted automata and weighted logics
This page was built for publication: Decision Problems of Finite Automata Design and Related Arithmetics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3848195)
