On theory of regular languages with the Kleene star operation

DOI10.1134/S1995080220090164MaRDI QIDQ2211370zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 11 November 2020

Published in Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1995080220090164

zbMATH Keywords

axiomatizationcategoricityEhrenfeucht-Fraïssé gamesKleene starPSPACE-completenessregular languagesspace complexity

Mathematics Subject Classification ID

Model theory of denumerable and separable structures (03C15) Models of other mathematical theories (03C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Formal languages and automata (68Q45)

Recommendations

• On decidability of theories of regular languages
• On decidability of regular languages theories
• scientific article; zbMATH DE number 1134629
• Kleene Closure on Regular and Prefix-Free Languages
• Equational axioms for regular sets

Cites work

• scientific article; zbMATH DE number 53151 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 5210936 (Why is no real title available?)
• scientific article; zbMATH DE number 3248792 (Why is no real title available?)
• Model Theory
• On decidability of regular languages theories
• Undecidability without arithmetization

Cited in

(4)

• On decidability of regular languages theories
• Kleene Closure on Regular and Prefix-Free Languages
• Regular languages of star height one
• scientific article; zbMATH DE number 2086619 (Why is no real title available?)

This page was built for publication: On theory of regular languages with the Kleene star operation

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