Products of finite state machines with full coverage

DOI10.1007/3-540-56939-1_95zbMath1418.68115OpenAlexW4248409184MaRDI QIDQ4630284

Michael L. Fredman, David Mordecai Cohen

Publication date: 29 March 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56939-1_95

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Network protocols (68M12)

Cites Work

• Zweifach transitive, auflösbare Permutationsgruppen
• Exponential 3/2-transitive permutation groups
• Unnamed Item
• Unnamed Item

This page was built for publication: Products of finite state machines with full coverage