Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID23rd DLT 2019: Warsaw, Poland
- Piotrek Hofman
, Michal Skrzypczak:
Developments in Language Theory - 23rd International Conference, DLT 2019, Warsaw, Poland, August 5-9, 2019, Proceedings. Lecture Notes in Computer Science 11647, Springer 2019, ISBN 978-3-030-24885-7
Invited Papers
- Udi Boker:
Inherent Size Blowup in ω-Automata. 3-17 - Artur Jez:
Deciding Context Unification (with Regular Constraints). 18-40 - Shinnosuke Seki:
Single-Stranded Architectures for Computing. 41-56
Regular Papers
- Umer Azfar, Costanza Catalano, Ludovic Charlier, Raphaël M. Jungers:
A Linear Bound on the K-Rendezvous Time for Primitive Sets of NZ Matrices. 59-73 - Jarkko Kari, Andrew Ryzhikov, Anton Varonka:
Words of Minimum Rank in Deterministic Finite Automata. 74-87 - Egor Dobronravov, Nikita Dobronravov, Alexander Okhotin:
On the Length of Shortest Strings Accepted by Two-Way Finite Automata. 88-99 - Di-De Yen, Hsu-Chun Yen:
Characterizing the Valuedness of Two-Way Finite Transducers. 100-112 - Viliam Geffert, Zuzana Bednárová, Alexander Szabari:
Input-Driven Pushdown Automata for Edit Distance Neighborhood. 113-126 - Hyunjoon Cheon, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
The Relative Edit-Distance Between Two Input-Driven Languages. 127-139 - Frantisek Mráz, Friedrich Otto:
On Shrinking Restarting Automata of Window Size One and Two. 140-153 - Ziyuan Gao:
The Teaching Complexity of Erasing Pattern Languages with Bounded Variable Frequency. 154-167 - Devendra Bhave, Shankara Narayanan Krishna, Ramchandra Phawade, Ashutosh Trivedi:
On Timed Scope-Bounded Context-Sensitive Languages. 168-181 - Paul Gastin, Amaldev Manuel, R. Govind:
Logics for Reversible Regular Languages and Semigroups with Involution. 182-191 - Simon Iosti, Denis Kuperberg:
Eventually Safe Languages. 192-205 - Denis Kuperberg, Laureline Pinault, Damien Pous:
Coinductive Algorithms for Büchi Automata. 206-220 - Paolo Massazza:
Hole-Free Partially Directed Animals. 221-233 - Anna E. Frid:
First Lower Bounds for Palindromic Length. 234-243 - Petr Ambroz, Edita Pelantová:
On Palindromic Length of Sturmian Sequences. 244-250 - Aleksi Saarela:
Separating Many Words by Counting Occurrences of Factors. 251-264 - Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka:
k-Spectra of Weakly-c-Balanced Words. 265-277 - Marie Lejeune, Julien Leroy, Michel Rigo:
Computing the k-binomial Complexity of the Thue-Morse Word. 278-291 - Tara Brough, Alan J. Cain, Markus Pfeiffer:
Context-Free Word Problem Semigroups. 292-305 - Massimiliano Goldwurm, Jianyi Lin, Marco Vignati:
Analysis of Symbol Statistics in Bicomponent Rational Models. 306-318
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-24 23:34 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:
