Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • describing the regular closure of the linear languages with graph-controlled insertion-deletion systems 2018-11-01 Paper Computational completeness of simple semi-conditional...
    10 bytes (16 words) - 03:09, 25 September 2023
  • Geometrical regular languages and linear Diophantine equations: the strongly connected case 2012-08-13 Paper Geometrical Regular Languages and Linear Diophantine...
    10 bytes (18 words) - 07:13, 9 December 2023
  • context-free and regular languages: the semi-linear case 2015-02-24 Paper On the commutative equivalence of bounded context-free and regular languages: the code...
    10 bytes (16 words) - 02:10, 12 December 2023
  • Tabulation of automata for tree-adjoining languages 2001-11-27 Paper https://portal.mardi4nfdi.de/entity/Q4939698 2000-02-09 Paper Regular Closure of Deterministic...
    10 bytes (19 words) - 14:33, 8 December 2023
  • Additive number theory via approximation by regular languages 2018-11-22 Paper Counting subwords and regular languages 2018-11-22 Paper https://portal.mardi4nfdi...
    10 bytes (19 words) - 16:09, 6 December 2023
  • Paper FINE HIERARCHY OF REGULAR APERIODIC ω-LANGUAGES 2008-11-24 Paper Complexity of Topological Properties of Regular ω-Languages 2008-10-30 Paper Fine...
    10 bytes (18 words) - 01:06, 11 December 2023
  • a Class of Regular Expressions with Counting, Interleaving, and Unordered Concatenation 2021-11-25 Paper Almost-linear inclusion for XML regular expression...
    10 bytes (17 words) - 19:13, 11 December 2023
  • Publication Date of Publication Type An algorithmic approach for checking closure properties of Ω-regular languages 2023-06-28 Paper Translating regular expressions...
    10 bytes (16 words) - 06:44, 9 December 2023
  • impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs 2015-02-05 Paper On the completeness of the semigraphoid...
    10 bytes (16 words) - 01:51, 9 December 2023
  • 2022-11-11 Paper Recognizing pro-\(\mathrm{R}\) closures of regular languages 2022-09-12 Paper The Complexity of Separation for Levels in Concatenation Hierarchies...
    10 bytes (16 words) - 01:45, 12 December 2023
  • a Class of Regular Expressions with Counting, Interleaving, and Unordered Concatenation 2021-11-25 Paper Almost-linear inclusion for XML regular expression...
    10 bytes (17 words) - 19:13, 11 December 2023
  • uncertainty and complete query languages 2010-08-18 Paper Topological formulation of termination properties of iterates of functions 2009-07-09 Paper Some...
    10 bytes (19 words) - 08:37, 12 December 2023
  • Publication Date of Publication Type A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices 2024-02-16 Paper...
    10 bytes (17 words) - 18:21, 9 December 2023
  • regularity of languages on a binary alphabet generated by copying systems 1993-04-01 Paper On a conjecture of Brown 1993-04-01 Paper On noncounting regular classes...
    10 bytes (17 words) - 07:37, 9 December 2023
  • 2017-11-22 Paper Composition closure of linear extended top-down tree transducers 2017-03-31 Paper Determinacy and rewriting of functional top-down and MSO...
    10 bytes (16 words) - 03:23, 9 December 2023
  • de/entity/Q4939573 2000-05-28 Paper Regular Closure of Deterministic Languages 1999-10-28 Paper Linear-time suffix parsing for deterministic languages 1998-01-21 Paper An...
    10 bytes (16 words) - 01:35, 13 December 2023
  • Whether a Regular Language Is Generated by a Splicing System 2012-11-06 Paper State Complexity of Star and Square of Union of k Regular Languages 2012-11-02...
    10 bytes (17 words) - 19:26, 9 December 2023
  • On the Number of Accepting States of Finite Automata 2016-12-20 Paper Regular languages of partial words 2016-07-08 Paper On the Power of Accepting Networks...
    10 bytes (17 words) - 17:43, 9 December 2023
  • deletion closure of languages 2000-08-21 Paper https://portal.mardi4nfdi.de/entity/Q3839708 1999-05-18 Paper Insertion and deletion closure of languages 1998-07-22...
    10 bytes (16 words) - 15:39, 12 December 2023
  • Top-Down Tree Edit-Distance of Regular Tree Languages 2014-03-31 Paper State Complexity of Subtree-Free Regular Tree Languages 2013-08-09 Paper Approximate...
    10 bytes (18 words) - 03:14, 25 September 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)