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

DOI10.1007/978-3-319-19225-3_23MaRDI QIDQ5500699zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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

Cites work

• scientific article; zbMATH DE number 1688359 (Why is no real title available?)
• scientific article; zbMATH DE number 1886068 (Why is no real title available?)
• scientific article; zbMATH DE number 3189697 (Why is no real title available?)
• Canonical nondeterministic automata
• Theory of átomata
• Theory of átomata

Cited in

(5)

• Yet another canonical nondeterministic automaton
• Yet another canonical nondeterministic automaton
• scientific article; zbMATH DE number 7559411 (Why is no real title available?)
• Lower bound methods for the size of nondeterministic finite automata revisited
• scientific article; zbMATH DE number 1688359 (Why is no real title available?)

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)