Seton Hall University

most citedFunctional Automata - Formal Languages for Computer Science Students

20 citations

researchers with a paper here

Jonathan Cutler1
Marco T. Morazán1
Nathan Kahl1
Rosario Antunez1

collaborating institutions

City College of New YorkUS1 paper
Montclair State UniversityUS1 paper

2 papers

cs.FL2014★ 20 cited

Functional Automata - Formal Languages for Computer Science Students

Marco T. Morazán, Rosario Antunez

An introductory formal languages course exposes advanced undergraduate and early graduate students to automata theory, grammars, constructive proofs, computability, and decidabilit…

math.CO2014

A note on the values of independence polynomials at $- 1$

Jonathan Cutler, Nathan Kahl

The independence polynomial $I (G; x)$ of a graph $G$ is $I (G; x) = \sum_{k = 1}^{α (G)} s_{k} x^{k}$ , where $s_{k}$ is the number of independent sets in $G$ of size $k$ . The decycling number of…

Functional Automata - Formal Languages for Computer Science Students

A note on the values of independence polynomials at −1

A note on the values of independence polynomials at $- 1$