scientific article

zbMATH Open0766.68077MaRDI QIDQ4036600FDOQ4036600

Kosaburo Hashiguchi

Publication date: 18 May 1993

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

zbMATH Keywords

regular languagenondeterministic finite automatonnumber of statesnumber of nonterminalsright-linear grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (3)

• Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language \(R \) with \(R_{1}\subseteq R\subseteq R_{2}\) for given regular languages \(R_{1},R_{2}\).
• On the number of rules needed for the automaton grammar to generate a finite language
• Deterministic generalized automata

   Recommendations

• Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language \(R \) with \(R_{1}\subseteq R\subseteq R_{2}\) for given regular languages \(R_{1},R_{2}\). 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Finite transducers and nondeterministic state complexity of regular languages 👍 👎
• State complexity of regular languages 👍 👎
• Title not available (Why is that?) 👍 👎
• Determination of finite automata accepting subregular languages 👍 👎
• Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages 👍 👎
• On the Number of Accepting States of 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 Q4036600)