Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID9th NCMA 2017: Prague, Czech Republic
- Rudolf Freund, Frantisek Mráz, Daniel Prusa:
Ninth Workshop on Non-Classical Models of Automata and Applications, NCMA 2017, Prague, Czech Republic, August 17-18, 2017. Österreichische Computer Gesellschaft 2017, ISBN 978-3-903035-18-8
Invited Papers
- Bianca Truthe:
Hierarchies of language families of contextual grammars. NCMA 2017: 13-28 - Jirí Wiedermann, Jan van Leeuwen:
Non-classical Turing machines: extending the notion of computation. NCMA 2017: 29-40
Regular Contributions
- Michal Ajdarów:
Minimality problems for promise versions of finite automata. NCMA 2017: 41-55 - Sandra Alves, Sabine Broda:
Inhabitation machines: determinism and principality. NCMA 2017: 57-70 - Dávid Angyal, Benedek Nagy:
An extension of the LR parsing algorithm for two-head pushdown automata. NCMA 2017: 71-86 - Cezar Câmpeanu:
State complexity of distinguishability combined with union operation. NCMA 2017: 87-101 - Henning Fernau, Martin Kutrib, Matthias Wendlandt:
Self-verifying pushdown automata. NCMA 2017: 103-117 - Henning Fernau, Meenakshi Paramasivan, D. Gnanaraj Thomas:
Regular grammars for array languages. NCMA 2017: 119-134 - Markus Holzer, Martin Kutrib, Friedrich Otto:
Two-sided strictly locally testable languages. NCMA 2017: 135-150 - Galina Jirásková, Matús Palmovský:
Star-complement-star and Kuratowski algebras on prefix-free languages. NCMA 2017: 151-164 - Andreas Malcher:
Decidability questions for insertion systems. NCMA 2017: 165-180 - Friedrich Otto:
On shrinking restarting automata. NCMA 2017: 181-195 - Giovanni Pighizzini, Luca Prigioniero:
Non-self-embedding grammars and descriptional complexity. NCMA 2017: 197-209 - Martin Plátek, Karel Oliva, Dana Pardubská:
Analysis by reduction of analytical PDT-trees. NCMA 2017: 211-226 - Qichao Wang:
On the expressive power of weighted restarting automata. NCMA 2017: 227-241 - Tomoyuki Yamakami:
A recursive definition of quantum polynomial time computability (extended abstract). NCMA 2017: 243-258
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-04-22 20:01 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:
