644 search results - page 33 / 129 » Precedence Automata and Languages |
CHARME
2003
Springer
15 years 3 months ago
2003
Springer
Industrial verification teams are actively developing suitable event sequence languages for hardware verification. Such languages must be expressive, designer friendly, and hardwar...
112
click to vote
LICS
2007
IEEE
15 years 5 months ago
2007
IEEE
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
EMSOFT
2006
Springer
15 years 3 months ago
2006
Springer
We describe a simple scheme for mapping synchronous language models, in the form of Boolean Mealy Machines, into timed automata. The mapping captures certain idealized implementat...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Büchi, regular languages have been classified according ...
DLOG
2003
15 years 26 days ago
2003
We present a translation of looping alternating two-way automata into a comparably inexpressive description logic, which is contained in SHIQ. This enables us to perform the empti...