scientific article; zbMATH DE number 3843141

MaRDI QIDQ3313264zbMATH OpenFDO

Authors Zofia Bien

Publication date 1981

zbMATH Keywords

complexity measuresnon-deterministic state graphsregular languagesstar measuretransition graphs

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• State complexity of regular languages
• Towards a theory of complexity of regular languages
• What is a complex regular language?
• In search of most complex regular languages
• scientific article; zbMATH DE number 2201359

Cited in

(14)

• The complexity of regular(-like) expressions
• In Search of Most Complex Regular Languages
• Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)
• A Similarity Measure for Cyclic Unary Regular Languages
• On the Density of Regular and Context-Free Languages
• scientific article; zbMATH DE number 4049104 (Why is no real title available?)
• Two complexity measures for context-free languages
• scientific article; zbMATH DE number 1860666 (Why is no real title available?)
• Regular languages viewed from a graph-theoretic perspective
• Sensing as a complexity measure
• Cognitive and sub-regular complexity
• What is a complex regular language?
• Digraph complexity measures and applications in formal language theory
• A COMPLEX MEASURE FOR LINEAR GRAMMARS

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