On Regular Expression Matching and Deterministic Finite Automata

Philip Bille

On Regular Expression Matching and Deterministic Finite Automata

Department of Applied Mathematics and Computer Science

Research output: Contribution to journal › Comment/debate › Research › peer-review

208 Downloads (Pure)

Original language	English
Journal	Tiny ToCS
Volume	3
Pages (from-to)	1
Publication status	Published - 2015

Bibliographical note

Vol. 3: Theory of Computation and Information Science
This content is released under the Creative Commons Attribution-NonCommercial ShareAlike License.

Access to Document

TinyToCS 3 billeFinal published version, 133 KB

http://tinytocs.org/

OpenUrl availability

Full text

Cite this

@article{6c876bd19d98480a838cdd81906c1789,

title = "On Regular Expression Matching and Deterministic Finite Automata",

author = "Philip Bille",

note = "Vol. 3: Theory of Computation and Information Science This content is released under the Creative Commons Attribution-NonCommercial ShareAlike License.",

year = "2015",

language = "English",

volume = "3",

pages = "1",

journal = "Tiny ToCS ",

}