Introduction to automata theory, languages, and computation, 2nd edition

By John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman. SIGA, 2001

1,332 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Molecular Biology

View Paper: https://www.semanticscholar.org/paper/0e90986bb100ba00d70727cf48dc44460847c05b

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Dilek Z. Hakkani-Tür
2. Marek Cygan
3. Jesper Nederlof
4. Stefan Kratsch
5. Hans L. Bodlaender
6. Vincent Vatter

In Molecular Biology

1. Neha Nayak Kennard
2. Jakub Onufry Wojtaszczyk
3. Abhinav Rastogi
4. Vincent Vatter
5. Larry Heck

Citations in the corpus

• Introduction to Information Retrieval (2008, neutral): “The underlying computer science appears in (Hopcroft et al. 2000).”
• Building a Conversational Agent Overnight with Dialogue Self-Play (2018, background): “B S is modeled as a fi-nite state machine (Hopcroft et al. (2006)) which encodes a set of task-independent rules for constructing system turns, with each turn consisting of a response frame which responds to the user’s previous turn, and an initiate frame which drives the dialogue forward through a…”
• Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time (2011, background): “In this case two partial solutions of a subtree of the tree decomposition are said to be equivalent if they are consistent with the same set of partial solutions on the remainder of the tree decomposition [37].”
• Small permutation classes (2007, background): “J. E. Hopcroft, R. Motwani and J. D. Ullman, Introduction to automata theory, languages, and computation, 2nd edn (Addison-Wesley, Reading, MA, 2001).”
• From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata (2006, neutral): “By dualizing the acceptance condition of the deterministic automaton we get an automaton for the complement language, which is again tight [HMU00].”
• Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (2013, background): “…dynamic programming routines for connectivity problems all information stored seemed needed: Given two partial solutions inducing differ-ent connectivity properties, one can be extendable to a solution while the other one can not (this resembles the notion of Myhill-Nerode equivalence classes [12]).”