scientific article; zbMATH DE number 1747444
From MaRDI portal
Publication:4531373
zbMATH Open1050.68093MaRDI QIDQ4531373FDOQ4531373
Markus Holzer, Kai Salomaa, Sheng Yu
Publication date: 2001
Title of this publication is not available (Why is that?)
Cited In (20)
- State Trade-Offs in Unranked Tree Automata
- Converting Self-verifying Automata into Deterministic Automata
- Minimizing finite automata is computationally hard
- State complexity of some operations on binary regular languages
- The tractability frontier for NFA minimization
- Extremal minimality conditions on automata
- Optimal simulation of self-verifying automata by deterministic automata
- A Finite State Version of the Kraft--McMillan Theorem
- Language equations with complementation: decision problems
- State complexity of combined operations
- Descriptional and Computational Complexity of Finite Automata
- Quotient complexity of closed languages
- State Complexity of Kleene-Star Operations on Trees
- Descriptional and computational complexity of finite automata -- a survey
- Language operations with regular expressions of polynomial size
- Descriptional complexity of regular languages
- VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states
- Decision problems for reversible and permutation automata
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
- Computational complexity of problems for deterministic presentations of sofic shifts
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4531373)
