| 청구기호 |
QA76.9.N38 |
| 판사항 |
1st ed. 2022.
|
| 형태사항 |
X, 251 p. 62 illus., 17 illus. in color. online resource.
|
| 총서명 |
Lecture Notes in Computer Science, 1611-3349 ; 13266
|
| 언어 |
English |
| 내용 |
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.
|
| 주제 |
Natural language processing (Computer science).
Database management.
Software engineering.
Computer science.
Machine theory.
Logic programming.
Natural Language Processing (NLP).
Database Management.
Software Engineering.
Computer Science Logic and Foundations of Programming.
Formal Languages and Automata Theory.
Logic in AI.
|
| 보유판 및 특별호 저록 |
Springer Nature eBook
Printed edition: 9783031074684
Printed edition: 9783031074707
|
| ISBN |
9783031074691 |
| 기타 표준번호 |
10.1007/978-3-031-07469-1 |
| QR CODE |
|
