Relativized Adjacency

Journal of Logic, Language and Information 32 (4):707-731 (2023)
  Copy   BIBTEX

Abstract

For each class in the piecewise-local subregular hierarchy, a relativized (tier-based) variant is defined. Algebraic as well as automata-, language-, and model-theoretic characterizations are provided for each of these relativized classes, except in cases where this is provably impossible. These various characterizations are necessarily intertwined due to the well-studied logic-automaton connection and the relationship between finite-state automata and (syntactic) semigroups. Closure properties of each class are demonstrated by using automata-theoretic methods to provide constructive proofs for the closures that do hold and giving language-theoretic counterexamples for those that do not. The net result of all of this is that, rather than merely existing as an operationally-defined parallel set of classes, these relativized variants integrate cleanly with the other members of the piecewise-local subregular hierarchy from every perspective. Relativization may even prove useful in the characterization of star-free, as every star-free stringset is the preprojection of another (also star-free) stringset whose syntactic semigroup is not a monoid.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,261

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Instructions for Authors.[author unknown] - 2004 - Journal of Logic, Language and Information 13 (4):541-546.
Note from the Editor.[author unknown] - 1999 - Journal of Logic, Language and Information 8 (2):3-3.
Instructions for Authors.[author unknown] - 2000 - Journal of Logic, Language and Information 9 (4):525-531.
Contents of Volume 11.[author unknown] - 2004 - Journal of Logic, Language and Information 11 (4):521-522.
Call for Papers.[author unknown] - 1999 - Journal of Logic, Language and Information 8 (1):135-136.
Call for Papers.[author unknown] - 2000 - Journal of Logic, Language and Information 9 (3):389-390.
Instructions for Authors.[author unknown] - 2002 - Journal of Logic, Language and Information 11 (1):133-139.
Instructions for Authors.[author unknown] - 2004 - Journal of Logic, Language and Information 13 (1):111-116.
Contents of Volume 8.[author unknown] - 1999 - Journal of Logic, Language and Information 8 (4):487-489.
Instructions for Authors.[author unknown] - 2003 - Journal of Logic, Language and Information 12 (4):537-543.
Call for Papers.[author unknown] - 1998 - Journal of Logic, Language and Information 7 (4):519-520.
Upcoming Themes.[author unknown] - 2004 - Journal of Logic, Language and Information 7 (1):115-115.
Contents of Volume 7.[author unknown] - 2004 - Journal of Logic, Language and Information 7 (4):509-511.
Contents of Volume 12.[author unknown] - 2003 - Journal of Logic, Language and Information 12 (4):533-535.
Instructions for Authors.[author unknown] - 2003 - Journal of Logic, Language and Information 12 (1):119-125.

Analytics

Added to PP
2023-05-20

Downloads
9 (#1,258,729)

6 months
7 (#439,760)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Aural Pattern Recognition Experiments and the Subregular Hierarchy.James Rogers & Geoffrey K. Pullum - 2011 - Journal of Logic, Language and Information 20 (3):329-342.
Linear Automaton Transformations.A. Nerode - 1963 - Journal of Symbolic Logic 28 (2):173-174.

Add more references