Measuring power of generalised definite languages

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

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

• Analytic combinatorics
• Characterizations of locally testable events
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Separating regular languages with first-order logic
• Codes and automata.
• Generalized Eilenberg theorem. I: Local varieties of languages
• Locally testable languages
• Algebraic decision procedures for local testability
• Lower Bound of the Number of Threshold Functions
• Measuring power of locally testable languages
• Title not available (Why is that?)
• Asymptotic approximation by regular languages
• Carathéodory extensions of subclasses of regular languages
• Title not available (Why is that?)

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)