Second-Order Finite Automata

DOI10.1007/978-3-030-50026-9_4MaRDI QIDQ5042226zbMATH OpenOpenAlexFDO

Authors Alexsander Andrade de Melo, Mateus de Oliveira Oliveira

Publication date 19 October 2022

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2108.12751

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Abstract regular tree model checking
• Automata and concurrency
• Graph automata
• scientific article; zbMATH DE number 177513 (Why is no real title available?)
• scientific article; zbMATH DE number 3460178 (Why is no real title available?)
• scientific article; zbMATH DE number 803291 (Why is no real title available?)
• Matrix-based complexity functions and recognizable picture languages
• On the minimization of (complete) ordered binary decision diagrams
• On the Width of Ordered Binary Decision Diagrams
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs

Cited in

(3)

• Second-order finite automata
• Properties of graphs specified by a regular language
• 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 Q5042226)