Seton Hall University

output

20142024

most citedFunctional Automata - Formal Languages for Computer Science Students

20 citations

researchers with a paper here

Marco T. Morazán3 profiles10 · h 8
Alexander Rodriguez1
Jack Howard1
Jonathan Cutler1
Josephine A. Des Rosiers1 · h 2
Joshua M. Schappel1 · h 1
Joshua Steier1 · h 1
Kalani Hettiarachchilage1
Nathan Kahl1
Neel Haldolaarachchige1
Rosario Antunez1
S. Mahashabde1 · h 1

collaborating institutions

Bergen Community CollegeUS1 paper
City College of New YorkUS1 paper
College of Staten IslandUS1 paper
Montclair State UniversityUS1 paper

Showing 2014Show all

2 papers · 1 filter

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$