Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • for the control of right linear grammars with unknown behaviors 2021-03-09 Paper Monotonically controlling right linear grammars with unknown behaviors to...
    10 bytes (16 words) - 01:49, 9 December 2023
  • transformation of LL\((k)\)-linear to LL(1)-linear grammars 2023-05-02 Paper On the Transformation of LL(k)-linear Grammars to LL(1)-linear 2022-10-19 Paper...
    10 bytes (16 words) - 23:04, 27 December 2023
  • for the control of right linear grammars with unknown behaviors 2021-03-09 Paper Monotonically controlling right linear grammars with unknown behaviors to...
    10 bytes (16 words) - 22:47, 24 September 2023
  • for the control of right linear grammars with unknown behaviors 2021-03-09 Paper Monotonically controlling right linear grammars with unknown behaviors to...
    10 bytes (16 words) - 22:47, 24 September 2023
  • algorithm for grammars with one-sided contexts 2017-10-20 Paper Generalized LR Parsing for Grammars with Contexts 2015-10-20 Paper Linear grammars with one-sided...
    10 bytes (16 words) - 20:03, 24 September 2023
  • for the control of right linear grammars with unknown behaviors 2021-03-09 Paper Monotonically controlling right linear grammars with unknown behaviors to...
    10 bytes (16 words) - 12:54, 28 January 2024
  • Publication Type Reducing control alphabet size for the control of right linear grammars with unknown behaviors 2021-03-09 Paper...
    10 bytes (16 words) - 22:47, 24 September 2023
  • Paper Multipass precedence analysis 1974-01-01 Paper Control sets on linear grammars 1974-01-01 Paper...
    10 bytes (18 words) - 11:42, 24 September 2023
  • LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata 2016-08-04 Paper LINEAR CONJUNCTIVE GRAMMARS AND ONE-TURN SYNCHRONIZED...
    10 bytes (16 words) - 14:52, 28 January 2024
  • mardi4nfdi.de/entity/Q3627240 2009-05-14 Paper Generation of Right-Linear Grammars from Regular Expressions 1971-01-01 Paper...
    10 bytes (18 words) - 14:08, 24 September 2023
  • mardi4nfdi.de/entity/Q5586338 1966-01-01 Paper Inherent ambiguity of minimal linear grammars 1964-01-01 Paper https://portal.mardi4nfdi.de/entity/Q5509971 1964-01-01...
    10 bytes (16 words) - 02:37, 28 December 2023
  • 2021-03-09 Paper On bounded linear codes and the commutative equivalence 2021-01-25 Paper Coding by minimal linear grammars 2020-08-17 Paper Locally Strongly...
    10 bytes (16 words) - 02:10, 12 December 2023
  • Applications 2006-10-20 Paper A note on the equivalence and complexity of linear grammars 2004-05-27 Paper Networks of evolutionary processors 2004-03-11 Paper...
    10 bytes (18 words) - 06:38, 12 December 2023
  • the Recognition of Linear Context-Free Languages 1966-01-01 Paper A New Normal-Form Theorem for Context-Free Phrase Structure Grammars 1965-01-01 Paper Formal...
    10 bytes (18 words) - 22:56, 12 December 2023
  • Paper Generalizations of regular events 1965-01-01 Paper On a family of linear grammars 1964-01-01 Paper The Production of Completion Signals by Asynchronous...
    10 bytes (18 words) - 12:59, 7 October 2023
  • Paper Generalizations of regular events 1965-01-01 Paper On a family of linear grammars 1964-01-01 Paper Group Properties of Free-Field Equations 1963-01-01...
    10 bytes (16 words) - 21:26, 24 September 2023
  • 2023-08-17 Paper Non-closure under complementation for unambiguous linear grammars 2023-05-19 Paper State complexity of transforming graph-walking automata...
    10 bytes (16 words) - 23:41, 24 September 2023
  • Non-closure under complementation for unambiguous linear grammars 2023-05-19 Paper The hardest language for grammars with context operators 2023-05-02 Paper On...
    10 bytes (17 words) - 09:17, 25 September 2023
  • symbolic picture description languages 2002-07-14 Paper Using linear positional grammars for the LR parsing of 2-D symbolic languages 2000-12-18 Paper...
    10 bytes (17 words) - 07:42, 12 December 2023
  • 1981-01-01 Paper The decidability of equivalence for a family of linear grammars 1980-01-01 Paper A note on the pumping lemma for regular languages 1979-01-01...
    10 bytes (17 words) - 12:16, 7 October 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)