scientific article; zbMATH DE number 7438576

MaRDI QIDQ5013886zbMATH OpenFDO

Authors Ryoma Sin'ya

Publication date 3 December 2021

Full work available at URL https://arxiv.org/abs/1509.07209, http://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF2015.13

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 7168170
• Towards a theory of complexity of regular languages
• scientific article; zbMATH DE number 7699973
• On decidability of regular languages theories
• On decidability of theories of regular languages
• Generalizations of 1-deterministic regular languages
• A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
• scientific article; zbMATH DE number 3917732
• Mathematical Foundations of Computer Science 2004
• AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS

Cites work

• A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
• A zero-one law for logic with a fixed-point operator
• Analytic combinatorics
• Codes and automata.
• Elements of automata theory. Translated from the French by Reuben Thomas
• Elements of finite model theory.
• Handbook of automata theory. Volume I. Theoretical foundations
• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• scientific article; zbMATH DE number 3561239 (Why is no real title available?)
• scientific article; zbMATH DE number 3588051 (Why is no real title available?)
• scientific article; zbMATH DE number 2016845 (Why is no real title available?)
• scientific article; zbMATH DE number 1759397 (Why is no real title available?)
• scientific article; zbMATH DE number 3213202 (Why is no real title available?)
• scientific article; zbMATH DE number 3415406 (Why is no real title available?)
• Infinitary logics and 0-1 laws
• LATIN 2004: Theoretical Informatics
• Probabilities on finite models
• Probability theory on discrete semigroups
• Reset words for commutative and solvable automata

Cited in

(10)

• Measuring power of locally testable languages
• scientific article; zbMATH DE number 7439745 (Why is no real title available?)
• scientific article; zbMATH DE number 7168170 (Why is no real title available?)
• Measuring power of generalised definite languages
• Deciding sparseness of regular languages of finite trees and infinite words
• Monotonicity characterizations of regular languages
• Monotonicity characterizations of regular languages
• Semidirect product decompositions for periodic regular languages
• Asymptotic approximation by regular languages
• Carathéodory extensions of subclasses of regular languages

This page was built for publication:

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