scientific article; zbMATH DE number 2068873

zbMath1137.68421MaRDI QIDQ4465333

Derek Kisman, Michael Domaratzki, Jeffrey O. Shallit

Publication date: 27 May 2004

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

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Formal languages and automata (68Q45) Asymptotic enumeration (05A16)

Related Items (20)

Minimizing nfa's and regular expressions ⋮ The state complexity of random DFAs ⋮ More on Deterministic and Nondeterministic Finite Cover Automata ⋮ State complexity of cyclic shift ⋮ A hitchhiker's guide to descriptional complexity through analytic combinatorics ⋮ Succinct representations for (non)deterministic finite automata ⋮ A large deviations principle for the Maki-Thompson rumour model ⋮ Enumeration and generation with a string automata representation ⋮ On the average state and transition complexity of finite languages ⋮ Compacted binary trees admit a stretched exponential ⋮ On binary circle plus operator \(\oplus\)-NFAs and succinct descriptions of regular languages ⋮ Exact enumeration of acyclic deterministic automata ⋮ Enumeration and random generation of accessible automata ⋮ State complexity of power ⋮ Compact Normal Form for Regular Languages as Xor Automata ⋮ Semicomputable points in Euclidean spaces ⋮ Learning Finite Automata Using Label Queries ⋮ Enumerating regular expressions and their languages ⋮ Succinct representation for (non)deterministic finite automata ⋮ More on deterministic and nondeterministic finite cover automata

This page was built for publication: