Second-order finite automata
From MaRDI portal
Publication:2158302
DOI10.1007/s00224-022-10085-wOpenAlexW3196874774MaRDI QIDQ2158302
Alexsander Andrade de Melo, Mateus de Oliveira Oliveira
Publication date: 26 July 2022
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-022-10085-w
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the minimization of (complete) ordered binary decision diagrams
- Automata and concurrency
- Second-order finite automata: expressive power and simple proofs using automatic structures
- Learning pattern languages over groups
- Learnability of automatic classes
- On the width of regular classes of finite structures
- Graph automata
- Automatic learners with feedback queries
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Automatic functions, linear time and learning
- On the Width of Ordered Binary Decision Diagrams
- Testing Membership in Languages that Have Small Width Branching Programs
- Automatic Learning from Positive Data and Negative Counterexamples
- On Testing Computability by Small Width OBDDs
- Testing Computability by Width Two OBDDs
- Branching Programs and Binary Decision Diagrams
- Second-Order Finite Automata
- Advice Automatic Structures and Uniformly Automatic Classes
- Automatic Structures
- Transforming structures by set interpretations
- Structures without Scattered-Automatic Presentation
This page was built for publication: Second-order finite automata