Skip to main content

Switch to dark mode

Search

Show all results for

Home

Publication

Special termination for log canonical pairs

About
Privacy
Disclaimer

Copyright © 2025 EPFL, all rights reserved

Graph Chatbot

Nikolaos Tsakanikas
2023

Abstract

We prove the special termination for log canonical pairs and its generalisation in the context of generalised pairs.

Official source

https://infoscience.epfl.ch/entities/publication/eda30e4f-5db5-48ba-9de9-2df0ba4e747e

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related concepts (6)

Context-free language

In formal language theory, a context-free language (CFL) is a language generated by a context-free grammar (CFG). Context-free languages have many applications in programming languages, in particular, most arithmetic expressions are generated by context-free grammars. Different context-free grammars can generate the same context-free language. Intrinsic properties of the language can be distinguished from extrinsic properties of a particular grammar by comparing multiple grammars that describe the language.

Context-sensitive grammar

A context-sensitive grammar (CSG) is a formal grammar in which the left-hand sides and right-hand sides of any production rules may be surrounded by a context of terminal and nonterminal symbols. Context-sensitive grammars are more general than context-free grammars, in the sense that there are languages that can be described by a CSG but not by a context-free grammar. Context-sensitive grammars are less general (in the same sense) than unrestricted grammars.

Context-free grammar

In formal language theory, a context-free grammar (CFG) is a formal grammar whose production rules can be applied to a nonterminal symbol regardless of its context. In particular, in a context-free grammar, each production rule is of the form with a single nonterminal symbol, and a string of terminals and/or nonterminals ( can be empty). Regardless of which symbols surround it, the single nonterminal on the left hand side can always be replaced by on the right hand side.

Related publications (23)

A Research-Practice Partnership to Introduce Computer Science in Secondary School: Lessons from a Pilot Program

Francesco Mondada, Helena Kovacs, Jean-Philippe Pellet, Jessica Elke Dehler Zufferey, Barbara Bruno, Laila Abdelsalam El-Hamamsy

Context: Introducing Computer Science (CS) into formal education can be challenging, notably when considering the numerous stakeholders involved which include the students, teachers, schools, and policy makers. We believe these perspectives should be con ...

2023

Efficient Parsing with Derivatives and Zippers

Romain Edelmann

Parsing is the process that enables a computer system to make sense of raw data. Parsing is common to almost all computer systems: It is involved every time sequential data is read and elaborated into structured data. The theory of parsing usually focuses ...

EPFL2021

E-Scan: Consuming Contextual Data with Model Plugins

Anastasia Ailamaki, Viktor Sanca

Extracting value and insights from increasingly heterogeneous data sources involves multiple systems combining and consuming the data. With multi-modal and context-rich data such as strings, text, videos, or images, the problem of standardizing the data mo ...

2023