22 search results - page 3 / 5 » Regular Expressions with Numerical Constraints and Automata ... |
DOCENG
2003
ACM
13 years 11 months ago
2003
ACM
By exploiting the theories of automata and graphs, we propose algorithms and a process for editing valid XML documents [4][5]. The editing process avoids syntactic violations alto...
DIAGRAMS
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. The spider diagram logic forms a fragment of constraint diagram logic and is designed to be primarily used as a diagrammatic software specification tool. Our interest is ...
WIA
2004
Springer
13 years 11 months ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
ICC
2007
IEEE
14 years 3 days ago
2007
IEEE
— In this paper, a family of low-density parity-check (LDPC) degree distributions, whose decoding threshold on the binary erasure channel (BEC) admits a simple closed form, is pr...
POPL
2004
ACM
14 years 6 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...