Relativized adjacency

DOI10.1007/s10849-023-09398-xOpenAlexW4377099734MaRDI QIDQ6053841

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

characterizationmodel theoryfinite-state automataformal language theorysyntactic semigroupssubregular hierarchy

Mathematics Subject Classification ID

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

Cites Work

• Aural pattern recognition experiments and the subregular hierarchy
• Elements of finite model theory.
• Input strictly local tree transducers
• Characterizations of locally testable events
• Linear Automaton Transformations
• On Languages Piecewise Testable in the Strict Sense
• A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
• Fast Pattern Matching in Strings
• Algebraic decision procedures for local testability
• On finite monoids having only trivial subgroups
• On free monoids partially ordered by embedding
• The Transitive Reduction of a Directed Graph
• Language identification in the limit
• Efficient Learning of Tier-Based Strictly k-Local Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Relativized adjacency