Finite automata and the logic of one-place predicates
From MaRDI portal
Publication:5586356
DOI10.1090/trans2/059/02zbMath0192.07801OpenAlexW4229530564MaRDI QIDQ5586356
Publication date: 1962
Published in: Twelve Papers on Logic and Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/trans2/059/02
Related Items (17)
Order-theoretic Trees: Monadic Second-order Descriptions and Regularity ⋮ On the Tutte and Matching Polynomials for Complete Graphs ⋮ On decidability of monadic logic of order over the naturals extended by monadic predicates ⋮ Computability by monadic second-order logic ⋮ Computability of analog networks ⋮ Communicating Finite-State Machines and Two-Variable Logic ⋮ Automata and Logics for Concurrent Systems: Five Models in Five Pages ⋮ On syntactic congruences for \(\omega\)-languages ⋮ Automata over continuous time ⋮ Unnamed Item ⋮ First-order rewritability of ontology-mediated queries in linear temporal logic ⋮ The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates ⋮ Complementation of Branching Automata for Scattered and Countable N-Free Posets ⋮ Logic and rational languages of scattered and countable series-parallel posets ⋮ Finite acceptance of infinite words ⋮ Decidable Extensions of Church’s Problem ⋮ Automata on finite trees
This page was built for publication: Finite automata and the logic of one-place predicates
