scientific article; zbMATH DE number 1414314

zbMath0941.68599MaRDI QIDQ4942651

Hubert Comon, Florent Jacquemard

Publication date: 16 March 2000

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

zbMATH Keywords

complexityrewriting systemsautomata with constraints

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Ground reducibility is EXPTIME-complete, Towards an efficient construction of test sets for deciding ground reducibility, Weighted tree automata with constraints, Specification and proof in membership equational logic, Multitree automata that count, Weighted tree automata with constraints, Paths, tree homomorphisms and disequalities for -clauses, Emptiness and finiteness for tree automata with global reflexive disequality constraints