1222 search results - page 16 / 245 » Some Results on Directable Automata |
JUCS
2002
14 years 11 months ago
2002
: The problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the gene...
103
click to vote
LICS
2008
IEEE
15 years 6 months ago
2008
IEEE
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
113
click to vote
AC
1998
Springer
14 years 11 months ago
1998
Springer
Abstract: Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this wor...
101
click to vote
JALC
2006
14 years 11 months ago
2006
Formal methods are a popular means to specify and verify security properties of a variety of communication protocols. In this article we take a step towards the use of team automa...
108
click to vote
FUIN
2008
14 years 11 months ago
2008
Parsing Expression Grammar (PEG) is a new way to specify syntax, by means of a top-down process with limited backtracking. It can be directly transcribed into a recursive-descent ...