Monadic partition logics and finite automata

DOI10.1016/0304-3975(95)00113-1zbMath0872.03024OpenAlexW2015392704MaRDI QIDQ671644

Qijia Tian, Enshao Shen

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

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)

Related Items (4)

A generalized time quantifier approach to approximate reasoning ⋮ Monadic partition logics and finite automata ⋮ Classifying regular languages by a split game ⋮ Some notes on graph automata, tiling systems and partition logic

Uses Software

• GraphLog

Cites Work

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

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