scientific article; zbMATH DE number 7439745
From MaRDI portal
Publication:5015284
zbMath1478.68132arXiv1609.04101MaRDI QIDQ5015284
Publication date: 7 December 2021
Full work available at URL: https://arxiv.org/abs/1609.04101
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Descriptive complexity and finite models (68Q19)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Elements of finite model theory.
- A concrete approach to classical analysis
- The method of forced enumeration for nondeterministic automata
- Space-bounded reducibility among combinatorial problems
- On the equivalence, containment, and covering problems for the regular and context-free languages
- Experimental Descriptive Complexity
- From Equivalence to Almost-Equivalence, and Beyond—Minimizing Automata with Errors
- Weak Second‐Order Arithmetic and Finite Automata
- Hyper-minimizing minimized deterministic finite state automata
- Hyper-Minimization in O(n 2)
- Nondeterministic Space is Closed under Complementation
- Characterizing regular languages with polynomial densities
- Programming Techniques: Regular expression search algorithm
- The complexity of theorem-proving procedures
This page was built for publication:
