scientific article; zbMATH DE number 4049114

zbMATH Open0643.68121MaRDI QIDQ3786002FDOQ3786002

Authors: Oscar H. Ibarra, B. Ravikumar 

Publication date: 1987

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

Recommendations

• Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
• On the degree of ambiguity of finite automata
• On the relation between ambiguity and nondeterminism in finite automata
• scientific article; zbMATH DE number 4001492
• Ambiguity, nondeterminism and state complexity of finite automata

zbMATH Keywords

hierarchyregular languageKolmogorov complexitynondeterministic finite automatonsize complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Cited In (5)

• DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
• Succinct representations of languages by DFA with different levels of reliability
• Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
• Title not available (Why is that?)
• On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata

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 Q3786002)