Equivalence of infinite behavior of finite automata

DOI10.1016/0304-3975(84)90037-9zbMath0568.68036OpenAlexW1966870296MaRDI QIDQ1060562

H. Alaiwan

Publication date: 1984

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90037-9

zbMATH Keywords

time complexitydeterministic automatanon-deterministic automataalgorithm for deciding equivalence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (1)

The complementation problem for Büchi automata with applications to temporal logic

Cites Work

• Testing and generating infinite sequences by a finite automaton
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Equivalence of infinite behavior of finite automata