Finite automata as characterizations of minor closed tree families (extended abstract) (Q4630274)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7045127
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finite automata as characterizations of minor closed tree families (extended abstract) |
scientific article; zbMATH DE number 7045127 |
Statements
Finite automata as characterizations of minor closed tree families (extended abstract) (English)
0 references
29 March 2019
0 references
planar graph
0 references
rooted tree
0 references
regular expression
0 references
polynomial time algorithm
0 references
finite automaton
0 references
0.7478137612342834
0 references
0.7411953806877136
0 references
