Myths and Facts about the Efficient Implementation of Finite Automata and Lexical Analysis
No abstract available.
DOI 10.1007/bfb0026419
Related papers
- Down with Emacs Lisp: Dynamic Scope Analysis ICFP 2001
- Parikh's Theorem Made Symbolic POPL 2024
- String constraints with concatenation and transducers solved efficiently POPL 2018
- Optimal Time-Bounded Reachability Analysis for Concurrent Systems TACAS 2019
- Translation: Myth or Reality? (Panel Session) OOPSLA 1996
- Bidirectional Data Flow Analysis in Code Motion: Myth and Reality SAS 1998
- On Learning Polynomial Recursive Programs POPL 2024
- A functional toolkit for morphological and phonological processing, application to a Sanskrit tagger JFP 2005