Measuring power of generalised definite languages

DOI10.1007/978-3-031-40247-0_21OpenAlexW4385701303MaRDI QIDQ6199883

Ryoma Sin'ya

Publication date: 28 February 2024

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-40247-0_21

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• 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
• Measuring power of locally testable languages
• Locally testable languages
• Characterizations of locally testable events
• Separating Regular Languages with First-Order Logic
• Algebraic decision procedures for local testability
• Generalized Eilenberg Theorem I: Local Varieties of Languages
• Lower Bound of the Number of Threshold Functions

This page was built for publication: Measuring power of generalised definite languages