Finite automata as characterizations of minor closed tree families (extended abstract)

DOI10.1007/3-540-56939-1_86zbMath1418.68120OpenAlexW1569085408MaRDI QIDQ4630274

Arvind Kumar Gupta

Publication date: 29 March 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56939-1_86

zbMATH Keywords

polynomial time algorithmfinite automatonplanar graphrooted treeregular expression

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Graph minors. XX: Wagner's conjecture
• Easy problems for tree-decomposable graphs
• Nonconstructive tools for proving polynomial-time decidability

This page was built for publication: Finite automata as characterizations of minor closed tree families (extended abstract)