z-logo
open-access-imgOpen Access
Solving Language Equations and Disequations Using Looping Tree Automata with Colors
Author(s) -
Franz Baader,
Alexander Okhotin
Publication year - 2012
Language(s) - English
Resource type - Reports
DOI - 10.25368/2022.185
Subject(s) - concatenation (mathematics) , automaton , exptime , tree automaton , computer science , negation , tree (set theory) , theoretical computer science , set (abstract data type) , mathematics , algorithm , discrete mathematics , computational complexity theory , combinatorics , programming language , pspace

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom