@inproceedings{10.1007/978-3-030-24886-4_2,
    Abstract = {Given a ranked alphabet, context are terms with a single occurrence of a special symbol {\$}{\$}{\{}{\backslash}bullet {\}}{\$}{\$}(outside of the alphabet), which represents a missing subterm. One can naturally build equations over contexts: the context variables are treated as symbols of arity one and a substitution S assigns to each such a variable a context S(X). A substitution S is extended to terms with context variables in a natural way: S(X(t)) is a context S(X) in which the unique occurrence of {\$}{\$}{\{}{\backslash}bullet {\}}{\$}{\$}is replaced with S(t). For historical reasons, the satisfiability of context equations is usually referred to as context unification.},
    Address = {Cham},
    Author = {Je{\.{z}}, Artur},
    BookTitle = {Developments in Language Theory},
    Editor = {Hofman, Piotrek and Skrzypczak, Micha{{\l}}},
    File = {Deciding Context Unification (with Regular Constraints) - Jeż2019\_Chapter\_DecidingContextUnificationWith - a - a - q.pdf},
    ISBN = {978-3-030-24886-4},
    Pages = {18--40},
    Publisher = {Springer International Publishing},
    Title = {Deciding Context Unification (with Regular Constraints)},
    Year = {2019},
    date-added = {2019-08-08 10:42:15 +0200},
    date-modified = {2019-08-08 10:42:15 +0200},
    doi = {10.1007/978-3-030-24886-4_2}
}

@inproceedings{10.1007/978-3-030-24886-4_2, Abstract = {Given a ranked alphabet, context are terms with a single occurrence of a special symbol {\$}{\$}{{}{\backslash}bullet {}}{\$}{\$}(outside of the alphabet), which represents a missing subterm. One can naturally build equations over contexts: the context variables are treated as symbols of arity one and a substitution S assigns to each such a variable a context S(X). A substitution S is extended to terms with context variables in a natural way: S(X(t)) is a context S(X) in which the unique occurrence of {\$}{\$}{{}{\backslash}bullet {}}{\$}{\$}is replaced with S(t). For historical reasons, the satisfiability of context equations is usually referred to as context unification.}, Address = {Cham}, Author = {Je{.{z}}, Artur}, BookTitle = {Developments in Language Theory}, Editor = {Hofman, Piotrek and Skrzypczak, Micha{{\l}}}, File = {Deciding Context Unification (with Regular Constraints) - Jeż2019_Chapter_DecidingContextUnificationWith - a - a - q.pdf}, ISBN = {978-3-030-24886-4}, Pages = {18--40}, Publisher = {Springer International Publishing}, Title = {Deciding Context Unification (with Regular Constraints)}, Year = {2019}, date-added = {2019-08-08 10:42:15 +0200}, date-modified = {2019-08-08 10:42:15 +0200}, doi = {10.1007/978-3-030-24886-4_2} }