New Interpretation and Generalization of the Kameda-Weiner Method.

DOI10.4230/LIPICS.ICALP.2016.116MaRDI QIDQ4598258zbMATH OpenOpenAlexFDO

Authors Hellis Tamm

Publication date 19 December 2017

Full work available at URL http://doi.org/10.4230/LIPIcs.ICALP.2016.116

zbMATH Keywords

nondeterministic finite automataatoms of regular languagesNFA minimizationKameda-Weiner method

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 3947527
• Weiszfeld's method: old and new results
• A New Application of the Hardy-Littlewood-Kloosterman Method
• Some new PDE methods for weak KAM theory
• A new approach to Kostant's problem
• Generalized Kleinman-Newton method
• New procedure to generate multipliers in complex Neumann problem and effective Kohn algorithm
• New exact solutions of the Kawahara equation using generalized \(F\)-expansion method
• Some generalizations of the Newton-Kantorovich method
• Expanding the applicability of the Kantorovich's theorem for solving generalized equations using Newton's method

Cited in

(8)

• Lower bound methods for the size of nondeterministic finite automata revisited
• Yet another canonical nondeterministic automaton
• Nondeterministic syntactic complexity
• Forward bisimulations for nondeterministic symbolic finite automata
• The Kramer-Mesner method with tactical decompositions: some new unitals on 65 points
• Quotients and atoms of reversible languages
• Duality of Lattices Associated to Left and Right Quotients
• Yet another canonical nondeterministic automaton

This page was built for publication: New Interpretation and Generalization of the Kameda-Weiner Method.

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