Measuring power of locally testable languages

DOI10.1007/978-3-031-05578-2_22OpenAlexW4285131751MaRDI QIDQ2164008

Ryoma Sin'ya

Publication date: 11 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-05578-2_22

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Measuring power of locally testable languages ⋮ Measuring power of generalised definite languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotic approximation by regular languages
• Carathéodory extensions of subclasses of regular languages
• The dot-depth hierarchy of star-free languages is infinite
• Sur le produit de concatenation non ambigu
• Measuring power of locally testable languages
• Dot-depth of star-free events
• Locally testable languages
• Characterizations of locally testable events
• Separating Regular Languages with First-Order Logic
• Separating Regular Languages by Piecewise Testable and Unambiguous Languages
• Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages
• Duality and Equational Theory of Regular Languages
• A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
• The Dot-Depth Hierarchy, 45 Years Later
• Algebraic decision procedures for local testability
• On finite monoids having only trivial subgroups
• Generalized Eilenberg Theorem I: Local Varieties of Languages

This page was built for publication: Measuring power of locally testable languages