Finite automata on directed graphs

DOI10.1016/0022-0000(92)90012-8zbMath0749.68054OpenAlexW2125604350MaRDI QIDQ1191024

Shlomit S. Pinter, Michael Kaminski

Publication date: 27 September 1992

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(92)90012-8

zbMATH Keywords

closure propertiesemptiness problemgraph automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

A branching time logic with past operators

Cites Work

• Parallel program schemata
• Tree acceptors and some of their applications
• An Algorithm for the General Petri Net Reachability Problem
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Testing and generating infinite sequences by a finite automaton
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finite automata on directed graphs