Generalization of the double-reversal method of finding a canonical residual finite state automaton

DOI10.1007/978-3-319-19225-3_23zbMATH Open1432.68246OpenAlexW2403327439MaRDI QIDQ5500699FDOQ5500699

Authors: Hellis Tamm 

Publication date: 7 August 2015

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19225-3_23

Recommendations

• scientific article; zbMATH DE number 1886068
• scientific article; zbMATH DE number 1688359
• Some Minimality Results on Biresidual and Biseparable Automata
• scientific article; zbMATH DE number 2080668
• Minimal NFA and biRFSA Languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Canonical nondeterministic automata
• Theory of átomata
• Title not available (Why is that?)
• Theory of átomata
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Lower bound methods for the size of nondeterministic finite automata revisited
• Yet another canonical nondeterministic automaton
• Title not available (Why is that?)
• Yet another canonical nondeterministic automaton
• Title not available (Why is that?)

This page was built for publication: Generalization of the double-reversal method of finding a canonical residual finite state automaton

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