scientific article; zbMATH DE number 7800501

MaRDI QIDQ6190441

Christian Rauch, Markus Holzer

Publication date: 6 February 2024

Full work available at URL: https://cgi.cse.unsw.edu.au/~eptcs/paper.cgi?NCMA2022.12

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs
• The ranges of accepting state complexities of languages resulting from some operations
• The range of state complexities of languages resulting from the cascade product -- the unary case (extended abstract)
• On the Number of Accepting States of Finite Automata
• Operations on Permutation Automata
• Yet another proof of the cascade decomposition theorem for finite automata

This page was built for publication: