scientific article

zbMath1024.68543MaRDI QIDQ3152811

Sheng Yu

Publication date: 23 October 2002

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Transition complexity of language operations ⋮ Lower bounds for the transition complexity of NFAs ⋮ On the descriptional complexity of Watson-Crick automata ⋮ Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity ⋮ Hopcroft’s Minimization Technique: Queues or Stacks? ⋮ Optimal Lower Bounds on Regular Expression Size Using Communication Complexity ⋮ On the Hopcroft's minimization technique for DFA and DFCA ⋮ Descriptional complexity of regular languages

This page was built for publication: