Measuring power of generalised definite languages

DOI10.1007/978-3-031-40247-0_21MaRDI QIDQ6199883zbMATH OpenOpenAlexFDO

Authors 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

• scientific article; zbMATH DE number 3495598 (Why is no real title available?)
• scientific article; zbMATH DE number 3588051 (Why is no real title available?)
• scientific article; zbMATH DE number 1958322 (Why is no real title available?)
• scientific article; zbMATH DE number 7438576 (Why is no real title available?)
• scientific article; zbMATH DE number 3189697 (Why is no real title available?)
• Algebraic decision procedures for local testability
• Analytic combinatorics
• Asymptotic approximation by regular languages
• Carathéodory extensions of subclasses of regular languages
• Characterizations of locally testable events
• Codes and automata.
• Generalized Eilenberg theorem. I: Local varieties of languages
• Locally testable languages
• Lower Bound of the Number of Threshold Functions
• Measuring power of locally testable languages
• Separating regular languages with first-order logic

Cited in

(1)

• Measuring power of commutative group languages

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

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