Relativized adjacency

DOI10.1007/S10849-023-09398-XMaRDI QIDQ6053841zbMATH OpenOpenAlexFDO

Authors Dakotah Lambert

Publication date 24 October 2023

Published in Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10849-023-09398-x

zbMATH Keywords

characterizationfinite-state automataformal language theorymodel theorysubregular hierarchysyntactic semigroups

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Descriptive complexity and finite models (68Q19) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• scientific article; zbMATH DE number 4051034
• scientific article; zbMATH DE number 1839454
• Some classes of sets of structures definable without quantifiers
• Around dot-depth one
• scientific article; zbMATH DE number 408810

Cites work

• A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
• Algebraic decision procedures for local testability
• Aural pattern recognition experiments and the subregular hierarchy
• Characterizations of locally testable events
• Efficient learning of tier-based strictly k-local languages
• Elements of finite model theory.
• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 3559875 (Why is no real title available?)
• scientific article; zbMATH DE number 1104369 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 1447282 (Why is no real title available?)
• Input strictly local tree transducers
• Language identification in the limit
• Linear Automaton Transformations
• On finite monoids having only trivial subgroups
• On free monoids partially ordered by embedding
• On languages piecewise testable in the strict sense
• Some classes of sets of structures definable without quantifiers
• The Transitive Reduction of a Directed Graph

Cited in

(2)

• Some classes of sets of structures definable without quantifiers
• Robust identification in the limit from incomplete positive data

This page was built for publication: Relativized adjacency

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