Search results
From MaRDI portal
- P. Deussen (section List of research outcomes)1979-01-01 Paper A unified approach to the generation and the acception of formal languages 1978-01-01 Paper Van Wijngaarden grammars and space complexity...10 bytes (17 words) - 12:53, 24 September 2023
- Gerard Zwaan (section List of research outcomes)A taxonomy of sublinear multiple keyword pattern matching algorithms 1997-03-25 Paper A systolic design for acceptors of regular languages 1990-01-01 Paper...10 bytes (16 words) - 20:39, 12 December 2023
- the derivation languages of phrase-structure grammars 1974-01-01 Paper A Class of Push-Down Acceptors for Adjunct Languages 1974-01-01 Paper An infinite...10 bytes (18 words) - 12:51, 13 December 2023
- Marcus Größer (section List of research outcomes)Effect of Tossing Coins in Omega-Automata 2009-10-22 Paper Validation of Stochastic Systems 2009-07-24 Paper Probabilistic Acceptors for Languages over Infinite...10 bytes (16 words) - 10:48, 6 October 2023
- expressive power of the shuffle operator matched with intersection by regular sets 2002-06-03 Paper Lower Space Bounds for Accepting Shuffle Languages 2000-12-18...10 bytes (17 words) - 15:58, 10 December 2023
- Henning Bordihn (section List of research outcomes)Determination of finite automata accepting subregular languages 2009-08-07 Paper Undecidability of Operation Problems for T0L Languages and Subclasses...10 bytes (16 words) - 16:16, 10 December 2023
- Eugene S. Santos (section List of research outcomes)Paper Realizations of fuzzy languages by probabilistic, max-product, and maximin automata 1975-01-01 Paper Max-product grammars and languages 1975-01-01 Paper...10 bytes (19 words) - 13:17, 28 January 2024
- Alberto Bertoni (section List of research outcomes)2003-12-16 Paper On the number of occurrences of a symbol in words of regular languages. 2003-08-17 Paper Regular languages accepted by quantum automata 2003-01-14...10 bytes (17 words) - 17:57, 9 December 2023
- Barbara Klunder (section List of research outcomes)Characterization of Star-Connected Languages Using Finite Automata 2008-11-20 Paper Finite Automata Accepting Star-Connected Languages 2008-06-10 Paper...10 bytes (16 words) - 15:45, 24 September 2023
- A. V. Babichev (section List of research outcomes)monadic theories of the second order as a basis for creating data specification languages 1999-05-03 Paper Classification of control of types in programs...10 bytes (18 words) - 15:38, 6 October 2023
- Michael Domaratzki (section List of research outcomes)complexity of language operations 2007-12-19 Paper Bond-free DNA language classes 2007-11-27 Paper Lower Bounds for the Transition Complexity of NFAs 2007-09-05...10 bytes (17 words) - 09:46, 24 September 2023
- Anne Kaldewaij (section List of research outcomes)A systolic design for acceptors of regular languages 1990-01-01 Paper Searching by elimination 1990-01-01 Paper The derivation of systolic computations...10 bytes (16 words) - 12:08, 7 October 2023
- Carlo Mereghetti (section List of research outcomes)machines that accept nonregular languages 2010-06-17 Paper On the Expressive Power of FO[ + ] 2010-05-26 Paper More concise representation of regular languages...10 bytes (17 words) - 17:09, 6 October 2023
- Christel Baier (section List of research outcomes)2009-03-03 Paper Probabilistic Acceptors for Languages over Infinite Words 2009-02-03 Paper On-the-Fly Stuttering in the Construction of Deterministic ω-Automata...10 bytes (17 words) - 01:51, 9 December 2023
- Nathalie Bertrand (section List of research outcomes)de/entity/Q5111899 2020-05-27 Paper A tale of two diagnoses in probabilistic systems 2019-12-18 Paper Parameterized verification of synchronization in constrained...10 bytes (16 words) - 21:49, 22 September 2023
- Kosaburo Hashiguchi (section List of research outcomes)Publication Date of Publication Type Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids 2004-10-27...10 bytes (16 words) - 18:43, 6 October 2023
- Giovanni Pighizzini (section List of research outcomes)lower bounds for Turing machines that accept nonregular languages 2010-06-17 Paper Pairs of Complementary Unary Languages with “Balanced” Nondeterministic Automata...10 bytes (17 words) - 11:23, 6 October 2023
- Dirk Vermeir (section List of research outcomes)1979-01-01 Paper On acceptors of iteration languages 1979-01-01 Paper https://portal.mardi4nfdi.de/entity/Q3051396 1978-01-01 Paper On ETOL systems of finite index...10 bytes (16 words) - 13:00, 11 December 2023
- Markus Holzer (section List of research outcomes)Paper Decidability of Right One-Way Jumping Finite Automata 2021-04-19 Paper The Ranges of Accepting State Complexities of Languages Resulting from Some...10 bytes (17 words) - 03:32, 9 December 2023
- Sheila A. Greibach (section List of research outcomes)complexity of nondeterministic counter languages 1976-01-01 Paper Some uniformly erasable families of languages 1976-01-01 Paper One counter languages and the...10 bytes (18 words) - 22:56, 12 December 2023
