(Wim Martens and Joachim Niehren) Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. First, we study unranked tree automata that are standard in database theory, assuming bottom-up determinism
Read More - Register for Free Membership
SQL Server, Azure SQL Database, Amazon RDS & AWS, Oracle and IBM Help