512 search results - page 22 / 103 » Automata as Abstractions |
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
FOSSACS
2008
Springer
13 years 10 months ago
2008
Springer
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...
CPM
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The efficiency of regular expression matching algorithms depends very much on the size of the nondeterministic finite automata (NFA) obtained from regular expressions. R...
ACRI
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. This paper reviews the history of embedded, evolvable selfreplicating structures implemented as cellular automata systems. We relate recent advances in this field to the...
TAPSOFT
1997
Springer
14 years 22 days ago
1997
Springer
Abstract. This paper presents a formalization of nite and in nite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheor...