643 search results - page 16 / 129 » Parsing And Derivational Equivalence |
CORR
2009
Springer
13 years 5 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
Abstract. Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of...
CDC
2008
IEEE
14 years 1 months ago
2008
IEEE
—Approximate Dynamic Inversion (ADI) has been established as a method to control minimum-phase, nonaffine-incontrol systems. Previous results have shown that for single-input no...
LICS
2008
IEEE
14 years 1 months ago
2008
IEEE
We investigate the (in)equational theory of impossible futures semantics over the process algebra BCCSP. We prove that no finite, sound axiomatization for BCCSP modulo impossible...
ICCAD
1997
IEEE
13 years 11 months ago
1997
IEEE
Traditional minimum area retiming algorithms attempt to achieve their prescribed objective with no regard to maintaining the initial state of the system. This issue is important f...