| Publication | Date of Publication | Type |
|---|
Automata
| 2024-02-07 | Paper |
Conclusive tree-controlled grammars
| 2024-02-06 | Paper |
On elimination of erasing rules from E0S grammars
Computer Science Journal of Moldova | 2023-09-06 | Paper |
CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model
Acta Informatica | 2022-09-26 | Paper |
Multi-island finite automata and their even computation.
Kybernetika | 2022-02-22 | Paper |
CD grammar systems with two propagating scattered context components characterize the family of context sensitive languages
| 2021-12-13 | Paper |
Scattered context grammars with one non-context-free production are computationally complete
Fundamenta Informaticae | 2021-11-15 | Paper |
General CD grammar systems and their simplification
| 2021-05-12 | Paper |
Descriptional complexity of three-nonterminal scattered context grammars: an improvement
| 2021-01-26 | Paper |
On operations over language families
Computer Science Journal of Moldova | 2020-11-02 | Paper |
On double-jumping finite automata and their closure properties
RAIRO - Theoretical Informatics and Applications | 2019-07-18 | Paper |
Jumping scattered context grammars
Fundamenta Informaticae | 2017-12-05 | Paper |
Modern Language Models and Computation
| 2017-12-01 | Paper |
Corrigendum to: ``Simple matrix grammars and their leftmost variants
International Journal of Foundations of Computer Science | 2016-11-18 | Paper |
Simple matrix grammars and their leftmost variants
International Journal of Foundations of Computer Science | 2016-07-27 | Paper |
scientific article; zbMATH DE number 6606360 (Why is no real title available?)
| 2016-07-26 | Paper |
scientific article; zbMATH DE number 6606350 (Why is no real title available?)
| 2016-07-26 | Paper |
Controlled pure grammar systems
Journal of Universal Computer Science | 2016-07-08 | Paper |
Jumping grammars
International Journal of Foundations of Computer Science | 2015-12-11 | Paper |
One-sided random context grammars: a survey
Computing with New Resources | 2015-09-08 | Paper |
A variant of pure two-dimensional context-free grammars generating picture languages
Lecture Notes in Computer Science | 2015-04-17 | Paper |
Solutions to four open problems concerning controlled pure grammar systems
International Journal of Computer Mathematics | 2014-10-14 | Paper |
Controlled finite automata
Acta Informatica | 2014-08-29 | Paper |
Regulated grammars and automata
| 2014-04-01 | Paper |
Formal languages and computation. Models and their applications
| 2014-03-11 | Paper |
Generalized one-sided forbidding grammars
International Journal of Computer Mathematics | 2013-12-23 | Paper |
One-sided random context grammars with a limited number of right random context rules
Theoretical Computer Science | 2013-12-13 | Paper |
Left random context ET0L grammars
Fundamenta Informaticae | 2013-06-27 | Paper |
Jumping finite automata
International Journal of Foundations of Computer Science | 2013-06-06 | Paper |
finitely expandable deep PDAs
Automata, Formal Languages and Algebraic Systems | 2013-06-03 | Paper |
On the generation of sentences with their parses by propagating regular-controlled grammars
Theoretical Computer Science | 2013-04-17 | Paper |
Rule-restricted automaton-grammar transducers: power and linguistic applications
Mathematics for Application | 2013-04-15 | Paper |
One-sided forbidding grammars and selective substitution grammars
International Journal of Computer Mathematics | 2013-01-22 | Paper |
An infinite hierarchy of language families resulting from stateless pushdown automata with limited pushdown alphabets
Descriptional Complexity of Formal Systems | 2012-11-02 | Paper |
One-sided random context grammars with leftmost derivations
Lecture Notes in Computer Science | 2012-11-01 | Paper |
Tree-controlled grammars with restrictions placed upon cuts and paths
Kybernetika | 2012-06-26 | Paper |
Nonterminal complexity of one-sided random context grammars
Acta Informatica | 2012-04-26 | Paper |
Self-reproducing pushdown transducers
| 2012-04-23 | Paper |
One-sided random context grammars
Acta Informatica | 2012-03-23 | Paper |
Parsing based on \(n\)-path tree-controlled grammars
| 2012-02-08 | Paper |
Some power-decreasing derivation restrictions in grammar systems
Schedae Informaticae | 2012-02-08 | Paper |
Scattered context grammars generating sentences followed by derivation trees
| 2012-02-08 | Paper |
Workspace theorems for regular-controlled grammars
Theoretical Computer Science | 2011-09-12 | Paper |
Left-forbidding cooperating distributed grammar systems
Theoretical Computer Science | 2010-10-11 | Paper |
Multigenerative grammar systems and matrix grammars
| 2010-05-28 | Paper |
On pure multi-pushdown automata that perform complete pushdown pops
| 2010-04-08 | Paper |
Descriptional complexity of semi-conditional grammars
Information Processing Letters | 2010-03-24 | Paper |
Scattered context grammars and their applications.
| 2010-03-08 | Paper |
An infinite hierarchy of language families generated by scattered context grammars with \(n\)-limited derivations
Theoretical Computer Science | 2009-05-28 | Paper |
On context-free rewriting with a simple restriction and its computational completeness
RAIRO - Theoretical Informatics and Applications | 2009-05-06 | Paper |
A simultaneous reduction of several measures of descriptional complexity in scattered context grammars
Information Processing Letters | 2009-03-23 | Paper |
Scattered context grammars that erase nonterminals in a generalized \(k\)-limited way
Acta Informatica | 2009-03-20 | Paper |
Two power-decreasing derivation restrictions in generalized scattered context grammars
| 2009-03-19 | Paper |
scientific article; zbMATH DE number 5506908 (Why is no real title available?)
| 2009-02-12 | Paper |
Elements of compiler design.
| 2008-04-18 | Paper |
Automata with two-sided pushdowns defined over free groups generated by reduced alphabets
| 2008-03-06 | Paper |
Maximal and Minimal Scattered Context Rewriting
Fundamentals of Computation Theory | 2008-02-26 | Paper |
Canonical scattered context generators of sentences with their parses
Theoretical Computer Science | 2008-01-07 | Paper |
Equivalent language models that closely simulate one another and their illustration in terms ofLsystems
International Journal of Computer Mathematics | 2007-11-26 | Paper |
Self-regulating finite automata
| 2007-10-26 | Paper |
GENERATION OF LANGUAGES BY REWRITING SYSTEMS THAT RESEMBLE AUTOMATA
International Journal of Foundations of Computer Science | 2006-10-16 | Paper |
Simple-semi-conditional versions of matrix grammars with a reduced regulating mechanism
| 2006-06-23 | Paper |
Deep pushdown automata
Acta Informatica | 2006-05-26 | Paper |
scientific article; zbMATH DE number 2213328 (Why is no real title available?)
| 2006-01-26 | Paper |
scientific article; zbMATH DE number 2226243 (Why is no real title available?)
| 2005-11-08 | Paper |
Grammars with Context Conditions and Their Applications
| 2005-11-07 | Paper |
scientific article; zbMATH DE number 2162201 (Why is no real title available?)
| 2005-04-28 | Paper |
Simultaneously One-Turn Two-Pushdown Automata
International Journal of Computer Mathematics | 2004-05-27 | Paper |
scientific article; zbMATH DE number 2068880 (Why is no real title available?)
| 2004-05-27 | Paper |
Forbidding ET0L grammars.
Theoretical Computer Science | 2004-03-14 | Paper |
Coincidental extension of scattered context languages
Acta Informatica | 2004-03-11 | Paper |
scientific article; zbMATH DE number 2050924 (Why is no real title available?)
| 2004-03-07 | Paper |
scientific article; zbMATH DE number 2013189 (Why is no real title available?)
| 2003-12-04 | Paper |
On the degree of scattered context-sensitivity.
Theoretical Computer Science | 2003-08-17 | Paper |
Homogeneous grammars with a reduced number of non-context-free products
Information Processing Letters | 2003-06-24 | Paper |
scientific article; zbMATH DE number 1886071 (Why is no real title available?)
| 2003-03-19 | Paper |
Descriptional Complexity Of Generalized Forbidding Grammars
International Journal of Computer Mathematics | 2003-03-05 | Paper |
scientific article; zbMATH DE number 1870506 (Why is no real title available?)
| 2003-02-18 | Paper |
scientific article; zbMATH DE number 1735621 (Why is no real title available?)
| 2002-04-29 | Paper |
Regulated pushdown automata
Acta Cybernetica | 2001-06-13 | Paper |
Uniform generation of languages by scattered context grammars
Fundamenta Informaticae | 2001-04-24 | Paper |
Generative power of three-nonterminal scattered context grammars
Theoretical Computer Science | 2000-10-26 | Paper |
scientific article; zbMATH DE number 709441 (Why is no real title available?)
| 2000-06-21 | Paper |
Terminating left-hand sides of scattered context productions M. Nivat
Theoretical Computer Science | 2000-06-04 | Paper |
scientific article; zbMATH DE number 1355184 (Why is no real title available?)
| 1999-10-31 | Paper |
scientific article; zbMATH DE number 1354905 (Why is no real title available?)
| 1999-10-31 | Paper |
Middle quotients of linear languages
International Journal of Computer Mathematics | 1999-09-15 | Paper |
scientific article; zbMATH DE number 1330031 (Why is no real title available?)
| 1999-09-01 | Paper |
Prefix pushdown automata and their simplification
International Journal of Computer Mathematics | 1999-06-29 | Paper |
Uniform rewriting based on permutations
International Journal of Computer Mathematics | 1998-09-07 | Paper |
Six-Nonterminal multi-sequential grammars characterize the family of recursively enumerable languages
International Journal of Computer Mathematics | 1998-06-11 | Paper |
Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages
International Journal of Computer Mathematics | 1997-03-06 | Paper |
Syntactic complexity of context-free grammars over word monoids
Acta Informatica | 1996-11-21 | Paper |
scientific article; zbMATH DE number 878947 (Why is no real title available?)
| 1996-05-14 | Paper |
Syntactic complexity of scattered context grammars
Acta Informatica | 1995-06-21 | Paper |
A formalization of sequential, parallel, and continuous rewriting
International Journal of Computer Mathematics | 1995-02-16 | Paper |
scientific article; zbMATH DE number 604883 (Why is no real title available?)
| 1994-09-15 | Paper |
scientific article; zbMATH DE number 617134 (Why is no real title available?)
| 1994-08-14 | Paper |
scientific article; zbMATH DE number 168433 (Why is no real title available?)
| 1993-05-16 | Paper |
scientific article; zbMATH DE number 4209616 (Why is no real title available?)
| 1991-01-01 | Paper |
Context free derivations on word monoids
Acta Informatica | 1990-01-01 | Paper |
Generalized forbidding grammars
International Journal of Computer Mathematics | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4068327 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4041294 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4045194 (Why is no real title available?)
| 1987-01-01 | Paper |
