On theory of regular languages with the Kleene star operation

DOI10.1134/S1995080220090164zbMath1486.03059OpenAlexW3100813075MaRDI QIDQ2211370

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

regular languagescategoricityaxiomatizationPSPACE-completenessKleene starspace complexityEhrenfeucht-Fraïssé games

Mathematics Subject Classification ID

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

Cites Work

• Undecidability without arithmetization
• On decidability of regular languages theories
• Model Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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