Second-order finite automata

DOI10.1007/S00224-022-10085-WOpenAlexW3196874774MaRDI QIDQ2158302FDOQ2158302

Authors: 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

Recommendations

• On the minimization of (complete) ordered binary decision diagrams
• String-matching with OBDDs
• Set automata
• scientific article; zbMATH DE number 1059244
• Finite automata and ordinals

zbMATH Keywords

fixed-parameter tractabilityordered decision diagramssecond-order finite automata

Mathematics Subject Classification ID

Theory of computing (68Qxx) Computability and recursion theory (03Dxx) Model theory (03Cxx)

Cites Work

• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Title not available (Why is that?)
• Branching Programs and Binary Decision Diagrams
• Title not available (Why is that?)
• Transforming structures by set interpretations
• Title not available (Why is that?)
• Abstract regular tree model checking
• Title not available (Why is that?)
• Learnability of automatic classes
• Testing Membership in Languages that Have Small Width Branching Programs
• Automata and concurrency
• On the Width of Ordered Binary Decision Diagrams
• On testing computability by small width OBDDs
• On the minimization of (complete) ordered binary decision diagrams
• Title not available (Why is that?)
• Advice Automatic Structures and Uniformly Automatic Classes
• Graph automata
• Testing Computability by Width Two OBDDs
• Second-Order Finite Automata
• Second-order finite automata: expressive power and simple proofs using automatic structures
• Automatic learners with feedback queries
• Automatic learning from positive data and negative counterexamples
• On the width of regular classes of finite structures
• Learning pattern languages over groups
• Automatic functions, linear time and learning
• Automatic Structures
• Automata-based presentations of infinite structures
• Structures without scattered-automatic presentation

Cited In (1)

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

This page was built for publication: Second-order finite automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2158302)