Opening book details…
Can I read Deterministic finite automata with recursive calls and DPDAs on EtoBox?
Deterministic finite automata with recursive calls and DPDAs by Jean H. Gallier; Salvatore La Torre; Supratik Mukhopadhyay is a Computer Science article available to read on EtoBox.
What is Deterministic finite automata with recursive calls and DPDAs about?
We study deterministic finite automata (DFA) with recursive calls, that is, finite sequences of component DFAs that can call each other recursively. DFAs with recursive calls are akin to recursive state machines and unrestricted hierarchic state machines. We show that they are language equivalent to deterministic pushdown automata (DPDA).
Who reads Deterministic finite automata with recursive calls and DPDAs?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Jean H. Gallier; Salvatore La Torre; Supratik Mukhopadhyay
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0020-0190)
- Published
- 2003
- Language
- EN
- Field
- Computer Science (Physical Sciences)