scientific article; zbMATH DE number 6136496

zbMATH Open1274.68166MaRDI QIDQ4905126

Daniel-Claudian Voinescu

Publication date: 15 February 2013

Title of this publication is not available (Why is that?)

zbMATH Keywords

minimizationregular languagecombinatorial dimensioncombinatorial alphabetextended DFA

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Hairpin Lengthening and Shortening of Regular Languages ⋮ Regular and Context-Free Pattern Languages over Small Alphabets ⋮ Efficient Enumeration of Regular Languages ⋮ Implementation and Application of Automata ⋮ Principles and Practice of Constraint Programming – CP 2004 ⋮ Concise representations of regular languages by degree and probabilistic finite automata

Recommendations

• Title not available (Why is that?) 👍 👎
• Succinct description of regular languages by weak restarting automata 👍 👎
• More concise representation of regular languages by automata and regular expressions 👍 👎
• Succinct representation of regular languages by Boolean automata. II 👍 👎
• The single loop representations of regular languages 👍 👎
• Descriptional complexity of regular languages 👍 👎
• Concise representations of regular languages by degree and probabilistic finite automata 👍 👎
• Efficient Enumeration of Regular Languages 👍 👎
• More Concise Representation of Regular Languages by Automata and Regular Expressions 👍 👎
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science 👍 👎

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