scientific article; zbMATH DE number 2182418

zbMATH Open1102.68055MaRDI QIDQ3022285FDOQ3022285

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

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

deterministic automatastate complexityFinite automatanondeterministic automatacover automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (8)

• Implementation and Application of Automata
• COUNTING THE NUMBER OF MINIMAL DFCA OBTAINED BY MERGING STATES
• Incremental construction of minimal deterministic finite cover automata
• More on deterministic and nondeterministic finite cover automata
• More on Deterministic and Nondeterministic Finite Cover Automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)