Second-Order Finite Automata

Melo, Alexsander Andrade de; Oliveira, Mateus de Oliveira

doi:10.1007/978-3-030-50026-9_4

Cited by 3 publications

(2 citation statements)

References 33 publications

(56 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [17], Kuske generalizes results of de Malo and de Oliveira Oliveira in [7] on secondorder finite automata by using automatic structures. As an application, Kuske shows in [17,Thm.…”

Section: Encoding Of Graphs and Related Workmentioning

confidence: 69%

See 1 more Smart Citation

Properties of graphs specified by a regular language

2022

View full text Add to dashboard Cite

Traditionally, graph algorithms get a single graph as input, and then they should decide if this graph satisfies a certain property $$\varPhi $$ Φ . What happens if this question is modified in a way that we get a possibly infinite family of graphs as an input, and the question is if there is a graph satisfying $$\varPhi $$ Φ in the family? We approach this question by using formal languages for specifying families of graphs, in particular by regular sets of words. We show that certain graph properties can be decided by studying the syntactic monoid of the specification language L if a certain torsion condition is satisfied. This condition holds trivially if L is regular. More specifically, we use a natural binary encoding of finite graphs over a binary alphabet $$\varSigma $$ Σ , and we define a regular set $$\mathbb {G}\subseteq \varSigma ^*$$ G ⊆ Σ ∗ such that every nonempty word $$w\in \mathbb {G}$$ w ∈ G defines a finite and nonempty graph. Also, graph properties can then be syntactically defined as languages over $$\varSigma $$ Σ . Then, we ask whether the automaton $$\mathcal {A}$$ A specifies some graph satisfying a certain property $$\varPhi $$ Φ . Our structural results show that we can answer this question for all “typical” graph properties. In order to show our results, we split L into a finite union of subsets and every subset of this union defines in a natural way a single finite graph F where some edges and vertices are marked. The marked graph in turn defines an infinite graph $$F^\infty $$ F ∞ and therefore the family of finite subgraphs of $$F^\infty $$ F ∞ where F appears as an induced subgraph. This yields a geometric description of all graphs specified by L based on splitting L into finitely many pieces; then using the notion of graph retraction, we obtain an easily understandable description of the graphs in each piece.

show abstract

“…In [17], Kuske generalizes results of de Malo and de Oliveira Oliveira in [7] on secondorder finite automata by using automatic structures. As an application, Kuske shows in [17,Thm.…”

Section: Encoding Of Graphs and Related Workmentioning

confidence: 69%

“…Hence, we can calculate a threshold t and a period p ≥ 1 such that R satisfies the (b, t, p)-torsion property. Since R is regular, the set 7 Hence, for some finite index sets J and I j we can write…”

Section: Switching the Alphabet And Parikh Imagesmentioning

confidence: 99%

Properties of graphs specified by a regular language

2022

View full text Add to dashboard Cite

show abstract

Second-Order Finite Automata: Expressive Power and Simple Proofs Using Automatic Structures

Kuske

2021

Developments in Language Theory

View full text Add to dashboard Cite

Second-Order Finite Automata

Melo

Oliveira

2022

Theory Comput Syst

Self Cite

View full text Add to dashboard Cite

Traditionally, finite automata theory has been used as a framework for the representation of possibly infinite sets of strings. In this work, we introduce the notion of second-order finite automata, a formalism that combines finite automata with ordered decision diagrams, with the aim of representing possibly infinite sets of sets of strings. Our main result states that second-order finite automata can be canonized with respect to the second-order languages they represent. Using this canonization result, we show that sets of sets of strings represented by second-order finite automata are closed under the usual Boolean operations, such as union, intersection, difference and even under a suitable notion of complementation. Additionally, emptiness of intersection and inclusion are decidable. We provide two algorithmic applications for second-order automata. First, we show that several width/size minimization problems for deterministic and nondeterministic ODDs are solvable in fixed-parameter tractable time when parameterized by the width of the input ODD. In particular, our results imply FPT algorithms for corresponding width/size minimization problems for ordered binary decision diagrams (OBDDs) with a fixed variable ordering. Previously, only algorithms that take exponential time in the size of the input OBDD were known for width minimization, even for OBDDs of constant width. Second, we show that for each k and w one can count the number of distinct functions computable by ODDs of width at most w and length k in time h(|Σ|,w) ⋅ kO(1), for a suitable $h:\mathbb {N}\times \mathbb {N}\rightarrow \mathbb {N}$ h : ℕ × ℕ → ℕ . This improves exponentially on the time necessary to explicitly enumerate all such functions, which is exponential in both the width parameter w and in the length k of the ODDs.

show abstract

Second-Order Finite Automata

Cited by 3 publications

References 33 publications

Properties of graphs specified by a regular language

Properties of graphs specified by a regular language

Second-Order Finite Automata: Expressive Power and Simple Proofs Using Automatic Structures

Second-Order Finite Automata

Contact Info

Product

Resources

About