scientific article; zbMATH DE number 7301304

MaRDI QIDQ5146522zbMATH OpenFDO

Authors Yuan Gao, Sheng Yu

Publication date 26 January 2021

Full work available at URL http://eptcs.web.cse.unsw.edu.au/paper.cgi?DCFS2009.11

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Approximation algorithms (68W25)

Recommendations

• State complexity and approximation
• State complexity research and approximation
• Estimation of state complexity of combined operations
• Finite state complexity
• scientific article; zbMATH DE number 1773091
• scientific article; zbMATH DE number 2182451
• State complexity and limited nondeterminism
• State complexity of code operators
• State complexity of combined operations
• State-size hierarchy for finite-state complexity

Cited in

(11)

• State complexity of pseudocatenation
• State complexity of combined operations involving catenation and binary Boolean operations: beyond the Brzozowski conjectures
• State Complexity of Deletion
• State complexity of cyclic shift
• State complexity of star of union and square of union on \textit{k} regular languages
• State complexity and approximation
• Complexity Approximation Principle
• scientific article; zbMATH DE number 7315090 (Why is no real title available?)
• State complexity research and approximation
• Length of the state trace: a method for partitioning model complexity
• The state complexity of \(L^{2}\) and \(L^k\)

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 Q5146522)