Weighted Automata and Logics on Infinite Graphs

Abstract We establish conditions under which the fundamental group of a graph of finite p-groups is necessarily residually p-finite. The technique of proof is independent of previously established results of this type, and the result is also valid for infinite graphs of groups.

Download Full-text

Schrödinger and polyharmonic operators on infinite graphs: Parabolic well-posedness and p-independence of spectra

Journal of Mathematical Analysis and Applications ◽

10.1016/j.jmaa.2020.124748 ◽

2021 ◽

Vol 495 (2) ◽

pp. 124748

Author(s):

Simon Becker ◽

Federica Gregorio ◽

Delio Mugnolo

Keyword(s):

Infinite Graphs ◽

Well Posedness

Download Full-text

PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA

International Journal of Foundations of Computer Science ◽

10.1142/s012905410700498x ◽

2007 ◽

Vol 18 (04) ◽

pp. 799-811

Author(s):

MATHIEU GIRAUD ◽

PHILLIPE VEBER ◽

DOMINIQUE LAVENIER

Keyword(s):

Surface Area ◽

Finite Automata ◽

Clock Frequency ◽

Partial Removal ◽

Frequency Constraints ◽

Weighted Automata ◽

Weighted Finite Automata ◽

Special Case

Weighted finite automata (WFA) are used with FPGA accelerating hardware to scan large genomic banks. Hardwiring such automata raises surface area and clock frequency constraints, requiring efficient ∊-transitions-removal techniques. In this paper, we present bounds on the number of new transitions for the development of acyclic WFA, which is a special case of the ∊-transitions-removal problem. We introduce a new problem, a partial removal of ∊-transitions while accepting short chains of ∊-transitions.

Download Full-text

Testing for cycles in infinite graphs with periodic structure

Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 ◽

10.1145/28395.28401 ◽

1987 ◽

Cited By ~ 15

Author(s):

K. Iwano ◽

K. Steiglitz

Keyword(s):

Periodic Structure ◽

Infinite Graphs

Download Full-text