scientific article; zbMATH DE number 2182451

zbMath1102.68076MaRDI QIDQ4681320

Sheng Yu

Publication date: 23 June 2005

Full work available at URL: http://iospress.metapress.com/link.asp?id=veemqfxm6n48cpxn

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

zbMATH Keywords

finite automataregular languagesfinite languagesState complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

From Quantum Query Complexity to State Complexity, On the state complexity of closures and interiors of regular languages with subwords and superwords, State complexity of cyclic shift, Concatenation of regular languages and descriptional complexity, Generalizations of the distributed Deutsch–Jozsa promise problem, A hitchhiker's guide to descriptional complexity through analytic combinatorics, Incomplete operational transition complexity of regular languages, State complexity of basic language operations combined with reversal, Nondeterministic state complexity of nested word automata, Estimation of state complexity of combined operations, Operational state complexity of nested word automata, Hopcroft’s Minimization Technique: Queues or Stacks?, Assisted Problem Solving and Decompositions of Finite Automata, State Complexity of Nested Word Automata, Analysing Complexity in Classes of Unary Automatic Structures, Unnamed Item, On the Hopcroft's minimization technique for DFA and DFCA, State complexity of unique rational operations, Concatenation of Regular Languages and Descriptional Complexity, Nondeterministic complexity in subclasses of convex languages