planar_language (545B)
1 # Planar language 2 3 A [regular_language] accepted by a [planar_automaton] 4 5 [book1976inherently]: 6 - every [regular_language] has a nondeterministic [planar_automaton] 7 - some [regular_languages] do not have deterministic [planar_automata] 8 - [bonfante2022genus]: [genus] forms a strict hierarchy 9 - still not known whether it is computable or what is the characterization 10 11 Other notion: [nguyen2023two] 12 13 Also: https://cstheory.stackexchange.com/questions/47427/planarity-of-planar-finite-automata-intersection 14 15 Up: [planar_graph], [regular_language]