Monadic partition logics and finite automata

DOI10.1016/0304-3975(95)00113-1zbMATH Open0872.03024OpenAlexW2015392704MaRDI QIDQ671644FDOQ671644

Authors: Enshao Shen, Qijia Tian 

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00113-1

Recommendations

• Publication:4864832
• scientific article; zbMATH DE number 857608
• scientific article; zbMATH DE number 988809
• scientific article; zbMATH DE number 1829145
• Propositional logic and cellular automata on monoids
• Product of partition logics, orthoalgebras, and automata
• Weighted automata and monadic second order logic
• Monadic logic programs and functional complexity
• Monadic logic and Löwenheim numbers
• Monoidal logics: completeness and classical systems

zbMATH Keywords

finite automataformal languagesmonadic partition logicsmonadic partition quantifiers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic with extra quantifiers and operators (03C80)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Languages that Capture Complexity Classes
• Monadic generalized spectra
• Classifying regular events in symbolic logic
• Weak Second‐Order Arithmetic and Finite Automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• First-order logic and star-free sets
• Some results on the generalized star-height problem
• Title not available (Why is that?)
• DETERMINISTIC AUTOMATA AND THE MONADIC THEORY OF ORDINALS < ω2
• Title not available (Why is that?)
• Henkin quantifiers and complete problems
• Application of model theoretic games to discrete linear orders and finite automata
• A partial approach to model checking
• Some notes on graph automata, tiling systems and partition logic
• Three characterizing numbers of partition logics
• Title not available (Why is that?)
• Downward transfer of satisfiability for sentences of L^1,1
• The monadic theory of ω₂
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Monadic partition logics and finite automata

Cited In (7)

• Some notes on graph automata, tiling systems and partition logic
• Some subsets of monadic first-order logic (MFO) used for the specification and synthesis of \(\Sigma\)-automata
• A generalized time quantifier approach to approximate reasoning
• Product of partition logics, orthoalgebras, and automata
• Classifying regular languages by a split game
• Title not available (Why is that?)
• Monadic partition logics and finite automata

Uses Software

• GraphLog

This page was built for publication: Monadic partition logics and finite automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671644)