Usefulness of information and unary languages

DOI10.1007/978-3-030-68195-1_11OpenAlexW3131352913WikidataQ116841311 ScholiaQ116841311MaRDI QIDQ2232271

Šimon Sádovský, Branislav Rovan, Giovanni Pighizzini

Publication date: 4 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-68195-1_11

zbMATH Keywords

regular languagestate complexitysupplementary informationdescriptional complexitydeterministic finite automatonunary language\( \lambda \)-cyclic languagedecomposability of regular languagesusefulness of information

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Usefulness of information and decomposability of unary regular languages

Cites Work

• Unnamed Item
• Unnamed Item
• Modeling time criticality of information
• Prime languages
• Simplifying DPDA Using Supplementary Information
• UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
• Assisted Problem Solving and Decompositions of Finite Automata
• On Usefulness of Information: Framework and NFA Case

This page was built for publication: Usefulness of information and unary languages