311 search results - page 42 / 63 » A Bialgebraic Approach to Automata and Formal Language Theor... |
IPL
2007
13 years 8 months ago
2007
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
ER
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In an ongoing effort to better understand the process of creating conceptual models (in particular formal ones), we present a fundamental view of the process of modeling...
DLS
2008
13 years 10 months ago
2008
Parsing Expression Grammar (PEG) is a recognition-based foundation for describing syntax that renewed interest in top-down parsing approaches. Generally, the implementation of PEG...
TLDI
2009
ACM
14 years 5 months ago
2009
ACM
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
TPHOL
2002
IEEE
14 years 1 months ago
2002
IEEE
We describe the operational and denotational semantics of a small imperative language in type theory with inductive and recursive definitions. The operational semantics is given b...