Language and Automata Theory and Applications - researchr conference series publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 656

2021

Learnability and Positive Equivalence RelationsDavid Belanger, Ziyuan Gao, Sanjay Jain 0001, Wei Li 0050, Frank Stephan 0001. LATA 2021: 145-156 [doi]

On Language Varieties Without Boolean OperationsFabian Birkmann, Stefan Milius, Henning Urbat. LATA 2021: 3-15 [doi]

Finite-Word HyperlanguagesBorzoo Bonakdarpour, Sarai Sheinvald. LATA 2021: 173-186 [doi]

Location Based Automata for Expressions with ShuffleSabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis. LATA 2021: 43-54 [doi]

Succinct Representations for (Non)Deterministic Finite AutomataSankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti. LATA 2021: 55-67 [doi]

Homomorphic Characterization of Tree Languages Based on Comma-Free EncodingStefano Crespi-Reghizzi, Pierluigi San Pietro. LATA 2021: 241-254 [doi]

On Balanced Sequences and Their Asymptotic Critical ExponentFrancesco Dolce, L'ubomíra Dvoráková, Edita Pelantová. LATA 2021: 293-304 [doi]

Partially Directed Animals with a Bounded Number of HolesValentina Dorigatti, Paolo Massazza. LATA 2021: 16-28 [doi]

Sequentiality of Group-Weighted Tree AutomataFrederic Dörband, Thomas Feller, Kevin Stier. LATA 2021: 267-278 [doi]

Approximated Determinisation of Weighted Tree AutomataFrederic Dörband, Thomas Feller, Kevin Stier. LATA 2021: 255-266 [doi]

Temporal Logics with Language ParametersJens Oliver Gutsfeld, Markus Müller-Olm, Christian Dielitz. LATA 2021: 187-199 [doi]

Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing WordsStefan Hoffmann. LATA 2021: 305-317 [doi]

State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary AlphabetsStefan Hoffmann. LATA 2021: 318-330 [doi]

Commutative Rational Term RewritingMamoru Ishizuka, Takahito Aoto 0001, Munehiro Iwami. LATA 2021: 200-212 [doi]

2 MonoidManasi S. Kulkarni, Jayalal Sarma, Janani Sundaresan. LATA 2021: 29-40 [doi]

Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Milan, Italy, March 1-5, 2021, ProceedingsAlberto Leporati, Carlos Martín-Vide, Dana Shapira, Claudio Zandron, editors, Volume 12638 of Lecture Notes in Computer Science, Springer, 2021. [doi]

Deciding Non-emptiness of Hypergraph Languages Generated by Connection-preserving Fusion Grammars is NP-completeAaron Lye. LATA 2021: 97-108 [doi]

Context-Free Grammars with LookaheadTakayuki Miyazaki, Yasuhiko Minamide. LATA 2021: 213-225 [doi]

On the Power of Nondeterministic Circuits and Co-Nondeterministic CircuitsHiroki Morizumi. LATA 2021: 109-117 [doi]

On Hardest Languages for One-Dimensional Cellular AutomataMikhail Mrykhin, Alexander Okhotin. LATA 2021: 118-130 [doi]

Cadences in Grammar-Compressed StringsJulian Pape-Lange. LATA 2021: 331-342 [doi]

Optimising Attractor Computation in Boolean Automata NetworksKévin Perrot, Pacôme Perrotin, Sylvain Sené. LATA 2021: 68-80 [doi]

On the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite AutomataSemyon Petrov, Alexander Okhotin. LATA 2021: 81-93 [doi]

Usefulness of Information and Unary LanguagesGiovanni Pighizzini, Branislav Rovan, Simon Sádovský. LATA 2021: 131-142 [doi]

Tree-Like Unit Refutations in Horn Constraint SystemsK. Subramani, Piotr J. Wojciechowski. LATA 2021: 226-237 [doi]

An Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted GraphsBastien Sérée, Loïg Jezequel, Didier Lime. LATA 2021: 279-290 [doi]

Learning Mealy Machines with One TimerFrits W. Vaandrager, Roderick Bloem, Masoud Ebrahimi 0002. LATA 2021: 157-170 [doi]

2020

Geometrically Closed Positive Varieties of Star-Free LanguagesOndrej Klíma 0002, Peter Kostolányi. LATA 2020: 328-340 [doi]

The New Complexity Landscape Around Circuit MinimizationEric Allender. LATA 2020: 3-16 [doi]

On the Size of Depth-Two Threshold Circuits for the Inner Product Mod 2 FunctionKazuyuki Amano. LATA 2020: 235-247 [doi]

On the Weisfeiler-Leman Dimension of Fractional PackingVikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky. LATA 2020: 357-368 [doi]

Nonstandard Cayley Automatic Representations for Fundamental Groups of Torus Bundles over the CircleDmitry Berdinsky, Prohrak Kruengthomya. LATA 2020: 115-127 [doi]

Boolean Monadic Recursive Schemes as a Logical Characterization of the Subsequential FunctionsSiddharth Bhaskar, Jane Chandlee, Adam Jardine, Christopher Oakden. LATA 2020: 157-169 [doi]

Lyndon Words versus Inverse Lyndon Words: Queries on Suffixes and Bordered WordsPaola Bonizzoni, Clelia de Felice, Rocco Zaccagnino, Rosalba Zizza. LATA 2020: 385-396 [doi]

$\langle \mathbb {R}, +, <, 1 \rangle $ Is Decidable in $\langle \mathbb {R}, +, < , \mathbb {Z}\rangle $Alexis Bès, Christian Choffrut. LATA 2020: 128-140 [doi]

Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus CasesLaure Daviaud. LATA 2020: 17-32 [doi]

Reducing the Ambiguity of Parikh MatricesJeffery Dick, Laura K. Hutchinson, Robert Mercas, Daniel Reidenbach. LATA 2020: 397-411 [doi]

Expressiveness and Conciseness of Timed Automata for the Verification of Stochastic ModelsSusanna Donatelli, Serge Haddad. LATA 2020: 170-183 [doi]

Complexity Issues of String to Graph Approximate MatchingRiccardo Dondi, Giancarlo Mauri, Italo Zoppis. LATA 2020: 248-259 [doi]

The Automatic Baire Property and an Effective Property of ømega-Rational FunctionsOlivier Finkel. LATA 2020: 303-314 [doi]

On Collapsing Prefix Normal WordsPamela Fleischmann, Mitja Kulczynski, Dirk Nowotka, Danny Bøgsted Poulsen. LATA 2020: 412-424 [doi]

Ordered Semiautomatic Rings with Applications to GeometryZiyuan Gao, Sanjay Jain 0001, Ji Qi, Philipp Schlicht, Frank Stephan 0001, Jacob Tarr. LATA 2020: 141-153 [doi]

Windable Heads and Recognizing NL with Constant RandomnessMehmet Utkan Gezer. LATA 2020: 184-195 [doi]

The Power of Programs over Monoids in [inline-graphic not available: see fulltext]Nathan Grosshans. LATA 2020: 315-327 [doi]

Approaching Arithmetic Theories with Finite-State AutomataChristoph Haase. LATA 2020: 33-43 [doi]

Recompression: Technique for Word Equations and Compressed DataArtur Jez. LATA 2020: 44-67 [doi]

Input Strictly Local Tree TransducersJing Ji, Jeffrey Heinz. LATA 2020: 369-381 [doi]

Alternating Finite Automata with Limited Universal BranchingChris Keeler, Kai Salomaa. LATA 2020: 196-207 [doi]

2 with Two OrdersNadia Labai, Tomer Kotek, Magdalena Ortiz, Helmut Veith. LATA 2020: 208-221 [doi]

Language and Automata Theory and Applications - 14th International Conference, LATA 2020, Milan, Italy, March 4-6, 2020, ProceedingsAlberto Leporati, Carlos Martín-Vide, Dana Shapira, Claudio Zandron, editors, Volume 12038 of Lecture Notes in Computer Science, Springer, 2020. [doi]

Context-Sensitive Fusion Grammars Are UniversalAaron Lye. LATA 2020: 275-286 [doi]

Simplified Parsing Expression DerivativesAaron Moss. LATA 2020: 425-436 [doi]

Complete Variable-Length Codes: An Excursion into Word Edit OperationsJean Néraud. LATA 2020: 437-448 [doi]

Cyclic Shift on Multi-component GrammarsAlexander Okhotin, Alexey Sorokin. LATA 2020: 287-299 [doi]

How to Prove that a Language Is Regular or Star-Free?Jean-Éric Pin. LATA 2020: 68-88 [doi]

Deciding Classes of Regular Languages: The Covering ApproachThomas Place. LATA 2020: 89-112 [doi]

Limited Two-Way Deterministic Finite Automata with AdviceAhmet Bilal Uçan. LATA 2020: 222-232 [doi]

Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping LemmasTomoyuki Yamakami. LATA 2020: 341-353 [doi]

Complexity of Automatic SequencesHans Zantema. LATA 2020: 260-271 [doi]

2019

On Varieties of Ordered AutomataOndrej Klíma 0001, Libor Polák. LATA 2019: 108-120 [doi]

The Range of State Complexities of Languages Resulting from the Cut OperationMarkus Holzer 0001, Michal Hospodár. LATA 2019: 190-202 [doi]

Closure and Nonclosure Properties of the Compressible and Rankable SetsJackson Abascal, Lane A. Hemaspaandra, Shir Maimon, Daniel Rubery. LATA 2019: 177-189 [doi]

Logic and Rational Languages of Scattered and Countable Series-Parallel PosetsAmazigh Amrane, Nicolas Bedon. LATA 2019: 275-287 [doi]

An Oracle Hierarchy for Small One-Way Finite AutomataM. Anabtawi, S. Hassan, Christos A. Kapoutsis, M. Zakzok. LATA 2019: 57-69 [doi]

Toroidal Codes and Conjugate PicturesMarcella Anselmo, Maria Madonia, Carla Selmi. LATA 2019: 288-301 [doi]

Orbits of Abelian Automaton GroupsTim Becker, Klaus Sutner. LATA 2019: 70-81 [doi]

Bounded Automata Groups are co-ET0LAlex Bishop, Murray Elder. LATA 2019: 82-94 [doi]

Regular Matching and Inclusion on Compressed Tree Patterns with Context VariablesIovka Boneva, Joachim Niehren, Momar Sakho. LATA 2019: 343-355 [doi]

A Note with Computer Exploration on the Triangle ConjectureChristophe Cordero. LATA 2019: 409-420 [doi]

Decidability of Sensitivity and Equicontinuity for Linear Higher-Order Cellular AutomataAlberto Dennunzio, Enrico Formenti, Luca Manzoni, Luciano Margara, Antonio E. Porreca. LATA 2019: 95-107 [doi]

Geometrical Closure of Binary V_3/2 LanguagesJean-Philippe Dubernard, Giovanna Guaiana, Ludovic Mignot. LATA 2019: 302-314 [doi]

Rule-Based Unification in Combined Theories and the Finite Variant PropertyAjay Kumar Eeralla, Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen. LATA 2019: 356-367 [doi]

Complexity of Regex CrosswordsStephen Fenner, Daniel Padé. LATA 2019: 215-230 [doi]

Modern Aspects of Complexity Within Formal LanguagesHenning Fernau. LATA 2019: 3-30 [doi]

Generalized Predictive Shift-Reduce Parsing for Hyperedge Replacement Graph GrammarsBerthold Hoffmann, Mark Minas. LATA 2019: 233-245 [doi]

Deterministic Biautomata and Subclasses of Deterministic Linear LanguagesGalina Jirásková, Ondrej Klíma 0001. LATA 2019: 315-327 [doi]

State Complexity of PseudocatenationLila Kari, Timothy Ng 0001. LATA 2019: 203-214 [doi]

Efficient Representation and Counting of Antipower Factors in WordsTomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba. LATA 2019: 421-433 [doi]

Transformation of Petri Nets into Context-Dependent Fusion GrammarsHans-Jörg Kreowski, Sabine Kuske, Aaron Lye. LATA 2019: 246-258 [doi]

Observation and Interaction - Invited PaperEdward A. Lee. LATA 2019: 31-42 [doi]

Learning Unions of k-Testable LanguagesAlexis Linard, Colin de la Higuera, Frits W. Vaandrager. LATA 2019: 328-339 [doi]

From Words to Graphs, and BackVadim V. Lozin. LATA 2019: 43-54 [doi]

On the Maximum Number of Distinct Palindromic Sub-arraysKalpana Mahalingam, Palak Pandoh. LATA 2019: 434-446 [doi]

Language and Automata Theory and Applications - 13th International Conference, LATA 2019, St. Petersburg, Russia, March 26-29, 2019, ProceedingsCarlos Martín-Vide, Alexander Okhotin, Dana Shapira, editors, Volume 11417 of Lecture Notes in Computer Science, Springer, 2019. [doi]

Automata over Infinite Sequences of RealsKlaus Meer, Ameen Naif. LATA 2019: 121-133 [doi]

Palindromic Subsequences in Finite WordsClemens Müllner, Andrew Ryzhikov. LATA 2019: 460-468 [doi]

Extensions of the Caucal Hierarchy?Pawel Parys. LATA 2019: 368-380 [doi]

Syntactic View of Sigma-Tau Generation of PermutationsWojciech Rytter, Wiktor Zuba. LATA 2019: 447-459 [doi]

Generalized Register Context-Free GrammarsRyoma Senda, Yoshiaki Takata, Hiroyuki Seki. LATA 2019: 259-271 [doi]

Nonuniform Families of Polynomial-Size Quantum Finite Automata and Quantum Logarithmic-Space Computation with Polynomial-Size AdviceTomoyuki Yamakami. LATA 2019: 134-145 [doi]

Equivalence Checking of Prefix-Free Transducers and Deterministic Two-Tape AutomataVladimir A. Zakharov. LATA 2019: 146-158 [doi]

Efficient Symmetry Breaking for SAT-Based Minimum DFA InferenceIlya Zakirzyanov, António Morgado, Alexey Ignatiev, Vladimir Ulyantsev, João Marques-Silva. LATA 2019: 159-173 [doi]

Tight Bounds on the Minimum Size of a Dynamic MonopolyAhad N. Zehmakan. LATA 2019: 381-393 [doi]

Recurrence in Multidimensional WordsÉmilie Charlier, Svetlana Puzynina, Élise Vandomme. LATA 2019: 397-408 [doi]

Links

Filter by Year
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top terms

[+]
OR AND NOT 1

Language and Automata Theory and Applications (LATA)

Viewing Publication 1 - 100 from 656

2021

2020

2019

2018

Links

Filter by YearOR AND NOT 1

Filter by Tag [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top terms [+]OR AND NOT 1

Language and Automata Theory and Applications (LATA)

Viewing Publication 1 - 100 from 656

2021

2020

2019

2018

Filter by Year
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top terms

[+]
OR AND NOT 1