State Complexity of Regular Tree Languages for Tree Matching
From MaRDI portal
Publication:2974061
DOI10.1142/S0129054116500398zbMath1364.68251MaRDI QIDQ2974061
Ha-Rim Lee, Yo-Sub Han, Sang-Ki Ko
Publication date: 6 April 2017
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Cites Work
- State complexity of star of union and square of union on \textit{k} regular languages
- State complexity of the concatenation of regular tree languages
- State complexity of union and intersection of square and reversal on \(k\) regular languages
- On the minimization of XML schemas and tree automata for unranked trees
- The state complexities of some basic operations on regular languages
- Estimation of state complexity of combined operations
- State complexity of combined operations
- ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION
- Pattern Matching in Trees
- Minimal Ascending and Descending Tree Automata
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
This page was built for publication: State Complexity of Regular Tree Languages for Tree Matching
