Implementation and Application of Automata
portes grátis
Implementation and Application of Automata
26th International Conference, CIAA 2022, Rouen, France, June 28 - July 1, 2022, Proceedings
Mignot, Ludovic; Caron, Pascal
Springer International Publishing AG
05/2022
251
Mole
Inglês
9783031074684
15 a 20 dias
409
Descrição não disponível.
?On 25 Years of CIAA Through the Lens of Data Science.- Manipulation of Regular Expressions Using Derivatives: an Overview.- How to Settle the ReDoS Problem: Back to the Classical Automata Theory.- Ordered Context-Free Grammars.- Symbolic Weighted Language Models, Quantitative Parsing and Automated Music Transcription.- A Similarity Measure for Formal Languages Based on Convergent Geometric Series.- Hybrid Tree Automata and the Yield Theorem for Constituent Tree Automata.- Some results concerning careful synchronization of partial automata and subset synchronization of DFA's.- A Toolkit for Parikh Matrices.- Syntax Checking Either Way.- On the Power of Pushing or Stationary Moves for Input-Driven Pushdown Automata.- The Cut Operation in Subclasses of Convex Languages (Extended Abstract).- Variations of the Separating Words Problem.- Homomorphisms on graph-walking automata.- Nondeterministic State Complexity of Site-Directed Deletion.- Energy Complexity of Regular Language Recognition.-Real-Time, Constant-Space, Constant-Randomness Verifiers.- Constrained Synchronization for Monotonic, Solvable and Automata with Simple Idempotents.- An Ambiguity Hierarchy of Weighted Context-free Grammars.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
artificial intelligence;automata;automata theory;automation;computational linguistics;computer science;computer systems;context free languages;databases;engineering;finite automata;formal languages;linguistics;mathematics;Natural Language Processing (NLP);natural languages;query languages;regular languages;theoretical computer science;translation (languages)
?On 25 Years of CIAA Through the Lens of Data Science.- Manipulation of Regular Expressions Using Derivatives: an Overview.- How to Settle the ReDoS Problem: Back to the Classical Automata Theory.- Ordered Context-Free Grammars.- Symbolic Weighted Language Models, Quantitative Parsing and Automated Music Transcription.- A Similarity Measure for Formal Languages Based on Convergent Geometric Series.- Hybrid Tree Automata and the Yield Theorem for Constituent Tree Automata.- Some results concerning careful synchronization of partial automata and subset synchronization of DFA's.- A Toolkit for Parikh Matrices.- Syntax Checking Either Way.- On the Power of Pushing or Stationary Moves for Input-Driven Pushdown Automata.- The Cut Operation in Subclasses of Convex Languages (Extended Abstract).- Variations of the Separating Words Problem.- Homomorphisms on graph-walking automata.- Nondeterministic State Complexity of Site-Directed Deletion.- Energy Complexity of Regular Language Recognition.-Real-Time, Constant-Space, Constant-Randomness Verifiers.- Constrained Synchronization for Monotonic, Solvable and Automata with Simple Idempotents.- An Ambiguity Hierarchy of Weighted Context-free Grammars.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
artificial intelligence;automata;automata theory;automation;computational linguistics;computer science;computer systems;context free languages;databases;engineering;finite automata;formal languages;linguistics;mathematics;Natural Language Processing (NLP);natural languages;query languages;regular languages;theoretical computer science;translation (languages)
