Operational complexity and pumping lemmas
From MaRDI portal
Publication:2170280
DOI10.1007/S00236-022-00431-3OpenAlexW4285891680WikidataQ124842188 ScholiaQ124842188MaRDI QIDQ2170280FDOQ2170280
Authors: Ismaël Jecker, Jürgen Dassow 
Publication date: 30 August 2022
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-022-00431-3
Recommendations
- On the computational complexity of finite operations
- scientific article; zbMATH DE number 5901113
- Further Remarks on the Operational Nonterminal Complexity
- Logical operations and Kolmogorov complexity
- On computability and learnability of the pumping lemma function
- Complexity theory for operators in analysis
- Complexity theory for operators in analysis
- Algorithms and Computation
- scientific article; zbMATH DE number 2090609
- scientific article; zbMATH DE number 7650250
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The state complexities of some basic operations on regular languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
- The ranges of state complexities for complement, star, and reversal of regular languages
- On the number of accepting states of finite automata
- A survey on operational state complexity
- The ranges of accepting state complexities of languages resulting from some operations
- Operational complexity and right linear grammars
- State complexity of cyclic shift
- Further Remarks on the Operational Nonterminal Complexity
Cited In (5)
This page was built for publication: Operational complexity and pumping lemmas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170280)
