scientific article; zbMATH DE number 1841842

zbMath1002.03032MaRDI QIDQ4783330

Hitoshi Ohsaki

Publication date: 4 December 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2142/21420539

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

decidabilityequational theorylinear bounded automatarecognizable tree languagesequational tree automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Equational classes, universal algebra in model theory (03C05)

Related Items

Alternating two-way AC-tree automata, XML schema, tree logic and sheaves automata, Tree Automata for Non-linear Arithmetic, Multitree automata that count