MONADIC PARTITION LOGICS AND FINITE AUTOMATA

Authors
SHEN ES TIAN QJ
Citation
Es. Shen et Qj. Tian, MONADIC PARTITION LOGICS AND FINITE AUTOMATA, Theoretical computer science, 166(1-2), 1996, pp. 63-81
Citations number
37
Categorie Soggetti
Computer Sciences","Computer Science Theory & Methods
Journal title
Theoretical computer science → ACNP
ISSN journal
03043975
Volume
166
Issue
1-2
Year of publication
1996
Pages
63 - 81
Database
ISI
SICI code
0304-3975(1996)166:1-2<63:MPLAFA>2.0.ZU;2-P
Abstract
By argumenting first-order logic with monadic partition quantifiers we get a new family of extended logics. They are strictly weaker in expr essive power than monadic second-order logic, have some good semantic features and offer better specification formalisms for studying finite automata and formal languages.