Second-order finite automata: expressive power and simple proofs using automatic structures

Second-order finite automata, introduced recently by Andrade de Melo and de Oliveira Oliveira, represent classes of languages. Since their semantics is defined by a synchronized rational relation, they can be studied using the theory of automatic structures. We exploit this connection to uniformly r...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	DLT (25. : 2021 : Porto, Portugal) Developments in Language Theory
1. Verfasser:	Kuske, Dietrich (VerfasserIn)
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	2021
Schlagworte:
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Bestellen

Titel	Jahr	Verfasser
A Strong Non-overlapping Dyck Code	2021	Barcucci, Elena
Properties of Graphs Specified by a Regular Language	2021	Diekert, Volker
Reducing Local Alphabet Size in Recognizable Picture Languages	2021	Reghizzi, Stefano Crespi
Two-Way Non-uniform Finite Automata	2021	Frei, Fabian
Deciding FO2 Alternation for Automata over Finite and Infinite Words	2021	Henriksson, Viktor
Reversible Top-Down Syntax Analysis	2021	Kutrib, Martin
Carathéodory Extensions of Subclasses of Regular Languages	2021	ya, Ryoma Sin
Second-order finite automata: expressive power and simple proofs using automatic structures	2021	Kuske, Dietrich
Compositions of Constant Weighted Extended Tree Transducers	2021	Blattmann, Malte
Active Learning of Sequential Transducers with Side Information About the Domain	2021	Berthon, Raphaël
State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters	2021	Hoffmann, Stefan
Integer Weighted Automata on Infinite Words	2021	Halava, Vesa
Definability Results for Top-Down Tree Transducers	2021	Maneth, Sebastian
A Linear-Time Simulation of Deterministic d-Limited Automata	2021	Rubtsov, Alexander A.
Upper Bounds on Distinct Maximal (Sub-)Repetitions in Compressed Strings	2021	Pape-Lange, Julian
Branching Frequency and Markov Entropy of Repetition-Free Languages	2021	Petrova, Elena A.
Morphic Sequences Versus Automatic Sequences	2021	Allouche, Jean-Paul
Parsimonious Computational Completeness	2021	Fernau, Henning
Extremal Binary PFAs in a Černý Family	2021	Cambie, Stijn
Variations on the Post Correspondence Problem for Free Groups	2021	Ciobanu, Laura

Alle Artikel auflisten