Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 798
Volume 798, December 2019
- Stavros Konstantinidis, Giovanni Pighizzini:
Special section on Descriptional Complexity of Formal Systems. 1 - Tomoyuki Yamakami:
State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis. 2-22 - Oscar H. Ibarra, Ian McQuillan
:
State grammars with stores. 23-39 - Da-Jung Cho, Yo-Sub Han, Kai Salomaa, Taylor J. Smith:
Site-directed insertion: Language equations and decision problems. 40-51 - Galina Jirásková, Alexander Okhotin:
State complexity of unambiguous operations on finite automata. 52-64 - Alexander Okhotin, Kai Salomaa:
Further closure properties of input-driven pushdown automata. 65-77 - Simon Beier, Markus Holzer:
Properties of right one-way jumping finite automata. 78-94 - Bruno Guillon, Luca Prigioniero:
Linear-time limited automata. 95-108 - Stefan Hetzl, Simon Wolfsteiner:
On the cover complexity of finite languages. 109-125
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-08-11 23:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
