scientific article; zbMATH DE number 1747444
From MaRDI portal
Publication:4531373
zbMath1050.68093MaRDI QIDQ4531373
Markus Holzer, Kai Salomaa, Sheng Yu
Publication date: 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (17)
State Complexity of Kleene-Star Operations on Trees ⋮ State complexity of combined operations ⋮ Language equations with complementation: decision problems ⋮ Quotient complexity of closed languages ⋮ The tractability frontier for NFA minimization ⋮ Extremal minimality conditions on automata ⋮ State complexity of some operations on binary regular languages ⋮ Minimizing finite automata is computationally hard ⋮ Descriptional and computational complexity of finite automata -- a survey ⋮ Optimal simulation of self-verifying automata by deterministic automata ⋮ Language operations with regular expressions of polynomial size ⋮ Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity ⋮ State Trade-Offs in Unranked Tree Automata ⋮ Descriptional and Computational Complexity of Finite Automata ⋮ Converting Self-verifying Automata into Deterministic Automata ⋮ Descriptional complexity of regular languages ⋮ Computational complexity of problems for deterministic presentations of sofic shifts
This page was built for publication:
