The proceedings contain 26 papers. The special focus in this conference is on Language and Automata Theory and Applications. The topics include: Usefulness of Information and Unary Languages; learnability and Positive Equivalence Relations; learning Mealy Machines with One Timer; temporal Logics with Language Parameters; commutative Rational Term Rewriting; context-Free Grammars with Lookahead; finite-Word Hyperlanguages; tree-Like Unit Refutations in Horn Constraint Systems; homomorphic Characterization of Tree Languages Based on Comma-Free Encoding; partially Directed Animals with a Bounded Number of Holes; approximated Determinisation of Weighted Tree Automata; sequentiality of Group-Weighted Tree Automata; an Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted Graphs; on Balanced Sequences and Their Asymptotic Critical Exponent; completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words; state Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets; cadences in Grammar-Compressed Strings; On the Computational Power of Programs over BA2 Monoid; location Based Automata for Expressions with Shuffle; succinct Representations for (Non)Deterministic Finite Automata; optimising Attractor Computation in Boolean Automata Networks; on the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite Automata; Deciding Non-emptiness of Hypergraph Languages Generated by Connection-preserving Fusion Grammars is NP-complete; on the Power of Nondeterministic Circuits and Co-Nondeterministic Circuits.
Leporati, A., Martin-Vide, C., Shapira, D., Zandron, C. (a cura di). (2021). Language and Automata Theory and Applications. 15th International Conference, LATA 2021, Milan, 1-5 March 2021, Proceedings. Cham : Springer [10.1007/978-3-030-68195-1].
Language and Automata Theory and Applications. 15th International Conference, LATA 2021, Milan, 1-5 March 2021, Proceedings
Leporati, A;Zandron, C
2021
Abstract
The proceedings contain 26 papers. The special focus in this conference is on Language and Automata Theory and Applications. The topics include: Usefulness of Information and Unary Languages; learnability and Positive Equivalence Relations; learning Mealy Machines with One Timer; temporal Logics with Language Parameters; commutative Rational Term Rewriting; context-Free Grammars with Lookahead; finite-Word Hyperlanguages; tree-Like Unit Refutations in Horn Constraint Systems; homomorphic Characterization of Tree Languages Based on Comma-Free Encoding; partially Directed Animals with a Bounded Number of Holes; approximated Determinisation of Weighted Tree Automata; sequentiality of Group-Weighted Tree Automata; an Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted Graphs; on Balanced Sequences and Their Asymptotic Critical Exponent; completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words; state Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets; cadences in Grammar-Compressed Strings; On the Computational Power of Programs over BA2 Monoid; location Based Automata for Expressions with Shuffle; succinct Representations for (Non)Deterministic Finite Automata; optimising Attractor Computation in Boolean Automata Networks; on the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite Automata; Deciding Non-emptiness of Hypergraph Languages Generated by Connection-preserving Fusion Grammars is NP-complete; on the Power of Nondeterministic Circuits and Co-Nondeterministic Circuits.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
