scientific article; zbMATH DE number 2182418

MaRDI QIDQ3022285zbMATH OpenFDO

Authors Lila Kari, Andrei Păun, C. Câmpeanu

Publication date 23 June 2005

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

zbMATH Keywords

deterministic automatastate complexityFinite automatanondeterministic automatacover automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Implementation and Application of Automata
• More on deterministic and nondeterministic finite cover automata
• More on deterministic and nondeterministic finite cover automata (extended abstract)
• scientific article; zbMATH DE number 1156489
• scientific article; zbMATH DE number 1962773

Cited in

(9)

• Implementation and Application of Automata
• Lower bound for converting an NFA with finite nondeterminism into an MDFA
• More on deterministic and nondeterministic finite cover automata (extended abstract)
• Incremental construction of minimal deterministic finite cover automata
• COUNTING THE NUMBER OF MINIMAL DFCA OBTAINED BY MERGING STATES
• More on deterministic and nondeterministic finite cover automata
• scientific article; zbMATH DE number 5181726 (Why is no real title available?)
• scientific article; zbMATH DE number 1927179 (Why is no real title available?)
• scientific article; zbMATH DE number 1962768 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3022285)